Active Bibliography

2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
2 Melding Priority Queues – Ran Mendelson, Robert E. Tarjan, Mikkel Thorup, Uri Zwick - 2004
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
2 A Generalization of Binomial Queues – Rolf Fagerberg - 1996
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 A General Technique for Implementation of Efficient Priority Queues – Peter Høyer - 1994
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
4 How to Find a Minimum Spanning Tree in Practice – Bernard M. E. Moret, Henry D. Shapiro - 1991
1 On sorting, heaps, and minimum spanning trees – Gonzalo Navarro, Rodrigo Paredes
20 An Empirical Analysis of Algorithms for Constructing a Minimum Spanning Tree – Bernard M. E. Moret, Henry D. Shapiro - 1991
7 Are Fibonacci Heaps Optimal? – Diab Abuaiadh, Jeffrey H. Kingston - 1994
15 A Parallel Priority Queue with Constant Time Operations – Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis - 1998
3 A Practical Shortest Path Algorithm with Linear Expected Time – Andrew V. Goldberg - 2001
37 Worst-Case Efficient External-Memory Priority Queues – Gerth Stølting Brodal, Jyrki Katajainen - 1998
12 A shortest path algorithm for real-weighted undirected graphs – Seth Pettie, Vijaya Ramachandran - 1985
27 Integer Priority Queues with Decrease Key in . . . – Mikkel Thorup - 2003
unknown title – Ulrich Meyer - 2001