Invited Presentation

Algorithms and Data Structures

Volume 955 of the series Lecture Notes in Computer Science pp 282-290


Fast meldable priority queues

  • Gerth Stølting BrodalAffiliated withBasic Research in Computer Science, Centre of the Danish National Research Foundation Department of Computer Science, University of Aarhus Ny Munkegade

* Final gross prices may vary according to local VAT.

Get Access


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.