Fast Meldable Priority Queues

  title={Fast Meldable Priority Queues},
  author={Gerth St\olting Brodal},
We present priority queues that support the operations MakeQueue, FindMin, Insert and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(logn). 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. ∗This work was… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
30 Citations
17 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 17 references

yer. A general technique for implementation of e cient priority queues

  • H Peter
  • Technical Report IMADA-94-33, Odense University,
  • 1994

and Rajeev Raman . A constant update time finger search tree

  • Yuzheng Ding, Mark Allen Weiss
  • Advances in Computing and Information - ICCI ’ 90…
  • 1990

Harold N . Gabow , Ruth Shrairman , and Robert E . Tarjan . Relaxed heaps : An alternative to fibonacci heaps with applications to parallel computation

  • Michael J. Fischer
  • Communications of the ACM
  • 1988

Similar Papers

Loading similar papers…