Pairing heaps with O(log log n) decrease cost (2009)

Cached

Download Links

by Amr Elmasry
Venue:In 20th ACM-SIAM Symposium on Discrete Algorithms
Citations:5 - 2 self

Active Bibliography

Pairing Heaps with Costless Meld – Amr Elmasry - 903
10 Towards a Final Analysis of Pairing Heaps – Seth Pettie - 2005
2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
2 Violation heaps: A better substitute for Fibonacci heaps – Amr Elmasry - 812
15 Splay trees, Davenport-Schinzel sequences, and the deque conjecture – Seth Pettie - 2007
A New Priority Queue for Simulation of Many Objects – Ricardo Baeza-yates, Mauricio Marín
4 An Empirical Comparison of Priority Queue Algorithms – Mauricio Marín
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
Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
Strict Fibonacci Heaps – Gerth Stølting Brodal, George Lagogiannis, Robert E. Tarjan
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
1 Queaps – John Iacono, Stefan Langerman - 2002
1 Priority Queues and Dijkstra’s Algorithm ∗ – Mo Chen, Rezaul Alam, Chowdhury Vijaya Ramach, David Lan, Roche Lingling Tong - 2007
24 A Performance Comparison of Event Calendar Algorithms: an Empirical Approach – Kehsiung Chung, Janche Sang, Vernon Rego - 1993
1 Parallel and Distributed Branch-and-Bound/A* Algorithms – V.-D. Cung, S. Dowaji, B. Le Cun, T. Mautor, C. Roucairol - 1994
Proceedings of the 1998 Winter Simulation Conference – Medeiros Watson Carson - 1998
4 GMSim: A Tool For Compositional GSMP Modeling – Frode B. Nilsen, Telenor Rd - 1998
5 GMSim: A generalized semi-Markov simulation environment – Frode B. Nilsen - 1998