Fast meldable priority queues

  • Gerth Stølting Brodal
Invited Presentation

DOI: 10.1007/3-540-60220-8_70

Part of the Lecture Notes in Computer Science book series (LNCS, volume 955)
Cite this paper as:
Brodal G.S. (1995) Fast meldable priority queues. In: Akl S.G., Dehne F., Sack JR., Santoro N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg

Abstract

We present priority queues that support the operations Find-Min, Insert, MakeQueue and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations where Meld takes worst case time o(n).

To our knowledge this is the first priority queue implementation that supports Meld in worst case constant time and DeleteMin in logarithmic time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Gerth Stølting Brodal
    • 1
  1. 1.Basic Research in Computer Science, Centre of the Danish National Research Foundation Department of Computer ScienceUniversity of Aarhus Ny MunkegadeÅrhus CDenmark

Personalised recommendations