Relaxed weak queues: an alternative to run-relaxed heaps (2005)

by Amr Elmasry , Claus Jensen , Jyrki Katajainen
Citations:4 - 3 self

Active Bibliography

8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
2 Putting your data structure on a diet – Hervé Brönnimann, Jyrki Katajainen, Pat Morin - 2007
5 Two new methods for transforming priority queues into double-ended priority queues – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
5 Functional Pearls: Explaining Binomial Heaps – Ralf Hinze - 1999
3 A Note on Worst Case Efficient Meldable Priority Queues – Rolf Fagerberg - 1996
Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
2 A Generalization of Binomial Queues – Rolf Fagerberg - 1996
Tuning af CPH STLs – Asger Bruun
2 Project proposal: A meldable, iterator-valid priority queue, CPH – Jyrki Katajainen - 2005
5 Numerical Representations as Higher-Order Nested Datatypes – Ralf Hinze - 1998
10 Persistent data structures – Haim Kaplan - 1995
13 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
37 Worst-Case Efficient External-Memory Priority Queues – Gerth Stølting Brodal, Jyrki Katajainen - 1998
The Randomized Complexity of Maintaining the Minimum – Gerth St Lting, Gerth St��lting Brodal, Jaikumar Radhakrishnan - 1996
Reflected Min-Max Heaps – Christos Makris Athanasios, Athanasios Tsakalidis, Kostas Tsichlas - 2003
2 Average-Case Complexity of Shortest-Paths Problems – Volker Priebe, Der Naturwissenschaftlich-technischen Fakultät I, Dekan Prof, Dr. Rainer Schulze-pillot-ziemen, Gutachter Prof, Dr. Kurt Mehlhorn, Prof Alan Frieze, Ph. D
Strict Fibonacci Heaps – Gerth Stølting Brodal, George Lagogiannis, Robert E. Tarjan
15 A Parallel Priority Queue with Constant Time Operations – Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis - 1998