A Generalization of Binomial Queues (1996)

Cached

Download Links

by Rolf Fagerberg
Venue:Information Processing Letters
Citations:2 - 0 self

Active Bibliography

Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
2 Discrete-Event Simulation on the Bulk-Synchronous Parallel Model – Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll - 1998
3 On the Pending Event Set and Binary Tournaments – Mauricio Marín
4 An Empirical Comparison of Priority Queue Algorithms – Mauricio Marín
9 A General Technique for Implementation of Efficient Priority Queues – Peter Høyer - 1994
2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
11 Fast Meldable Priority Queues – Gerth Stølting Brodal, Gerth Stlting Brodal - 1995
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
Strict Fibonacci Heaps – Gerth Stølting Brodal, George Lagogiannis, Robert E. Tarjan
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
7 Are Fibonacci Heaps Optimal? – Diab Abuaiadh, Jeffrey H. Kingston - 1994
1 On sorting, heaps, and minimum spanning trees – Gonzalo Navarro, Rodrigo Paredes
5 Two new methods for transforming priority queues into double-ended priority queues – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
37 Worst-Case Efficient External-Memory Priority Queues – Gerth Stølting Brodal, Jyrki Katajainen - 1998
18 Dijkstra’s algorithm with Fibonacci heaps: An executable description – Jon Sneyers, Tom Schrijvers, Bart Demoen - 2006
18 Checking Mergeable Priority Queues – Jonathan Bright, Gregory Sullivan - 1994