Thin Heaps, Thick Heaps (2006)

by Haim Kaplan , Robert E. Tarjan
Citations:2 - 1 self

Active Bibliography

Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
1 Priority Queues and Dijkstra’s Algorithm ∗ – Mo Chen, Rezaul Alam, Chowdhury Vijaya Ramach, David Lan, Roche Lingling Tong - 2007
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
1 On sorting, heaps, and minimum spanning trees – Gonzalo Navarro, Rodrigo Paredes
3 On the Pending Event Set and Binary Tournaments – Mauricio Marín
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
20 An Empirical Analysis of Algorithms for Constructing a Minimum Spanning Tree – Bernard M. E. Moret, Henry D. Shapiro - 1991
24 A Performance Comparison of Event Calendar Algorithms: an Empirical Approach – Kehsiung Chung, Janche Sang, Vernon Rego - 1993
2 A Generalization of Binomial Queues – Rolf Fagerberg - 1996
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
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
Finding Minimum Spanning Trees in O(m α(m,n)) Time – Seth Pettie - 1999
12 A shortest path algorithm for real-weighted undirected graphs – Seth Pettie, Vijaya Ramachandran - 1985
2 Solving Difference Constraints Incrementally – G. Ramalingam, J. Song, L. Joscovicz, R. E. Miller - 1995
Potentials and Limitations of Visual Methods for the Exploration of Complex Data Structures – Tobias Lauer - 2007
10 Towards a Final Analysis of Pairing Heaps – Seth Pettie - 2005
25 Dominators in Linear Time – Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup - 1997