Fast Meldable Priority Queues (1995)

by Gerth Stølting Brodal , Gerth Stlting Brodal
Citations:11 - 2 self

Active Bibliography

2 A Generalization of Binomial Queues – Rolf Fagerberg - 1996
Strict Fibonacci Heaps – Gerth Stølting Brodal, George Lagogiannis, Robert E. Tarjan
Partial and Higher Order Differentials – Lars R. Knudsen, Lars R. Knudsen - 1995
5 Two new methods for transforming priority queues into double-ended priority queues – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
Reflected Min-Max Heaps – Christos Makris Athanasios, Athanasios Tsakalidis, Kostas Tsichlas - 2003
Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
37 Worst-Case Efficient External-Memory Priority Queues – Gerth Stølting Brodal, Jyrki Katajainen - 1998
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
9 A General Technique for Implementation of Efficient Priority Queues – Peter Høyer - 1994
2 Discrete-Event Simulation on the Bulk-Synchronous Parallel Model – Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll - 1998
4 An Empirical Comparison of Priority Queue Algorithms – Mauricio Marín
3 On the Pending Event Set and Binary Tournaments – Mauricio Marín
9 Complexity Results for Model Checking – Allan Cheng, Allan Cheng - 1995
15 A Parallel Priority Queue with Constant Time Operations – Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis - 1998
2 Violation heaps: A better substitute for Fibonacci heaps – Amr Elmasry - 812
2 Putting your data structure on a diet – Hervé Brönnimann, Jyrki Katajainen, Pat Morin - 2007
3 A Note on Worst Case Efficient Meldable Priority Queues – Rolf Fagerberg - 1996
The Randomized Complexity of Maintaining the Minimum – Gerth St Lting, Gerth St��lting Brodal, Jaikumar Radhakrishnan - 1996