Project proposal: A meldable, iterator-valid priority queue, CPH (2005)

by Jyrki Katajainen
Citations:2 - 2 self

Active Bibliography

5 Two new methods for transforming priority queues into double-ended priority queues – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
2 Putting your data structure on a diet – Hervé Brönnimann, Jyrki Katajainen, Pat Morin - 2007
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
1 Abstract On the Power of Structural Violations in Priority Queues – Amr Elmasry, Claus Jensen, Jyrki Katajainen
Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
Strict Fibonacci Heaps – Gerth Stølting Brodal, George Lagogiannis, Robert E. Tarjan
2 Violation heaps: A better substitute for Fibonacci heaps – Amr Elmasry - 812
2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
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
Reflected Min-Max Heaps – Christos Makris Athanasios, Athanasios Tsakalidis, Kostas Tsichlas - 2003
3 A Note on Worst Case Efficient Meldable Priority Queues – Rolf Fagerberg - 1996
24 A Performance Comparison of Event Calendar Algorithms: an Empirical Approach – Kehsiung Chung, Janche Sang, Vernon Rego - 1993
4 Relaxed weak queues: an alternative to run-relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2005
2 A Generalization of Binomial Queues – Rolf Fagerberg - 1996
9 A General Technique for Implementation of Efficient Priority Queues – Peter Høyer - 1994
11 Fast Meldable Priority Queues – Gerth Stølting Brodal, Gerth Stlting Brodal - 1995