The Derivation of a Tighter Bound for Top-Down Skew Heaps (1991)

Cached

Download Links

by Anne Kaldewaij , Berry Schoenmakers
Citations:4 - 3 self

Active Bibliography

11 Data Structures and Amortized Complexity in a Functional Setting – Berry Schoenmakers - 1992
5 Pairing heaps with O(log log n) decrease cost – Amr Elmasry - 2009
1 On sorting, heaps, and minimum spanning trees – Gonzalo Navarro, Rodrigo Paredes
Pairing Heaps with Costless Meld – Amr Elmasry - 903
2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
7 Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking – Chris Okasaki - 1995
A New Priority Queue for Simulation of Many Objects – Ricardo Baeza-yates, Mauricio Marín
2 Discrete-Event Simulation on the Bulk-Synchronous Parallel Model – Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll - 1998
9 Portable Distributed Priority Queues with MPI – Bernard Mans, North Queensland - 1995
4 An Empirical Comparison of Priority Queue Algorithms – Mauricio Marín
3 On the Pending Event Set and Binary Tournaments – Mauricio Marín
10 Weight Biased Leftist Trees and Modified Skip Lists – S. Cho, S. Sahni, Seonghun Cho, Sartaj Sahni - 1996
15 Splay trees, Davenport-Schinzel sequences, and the deque conjecture – Seth Pettie - 2007
10 Towards a Final Analysis of Pairing Heaps – Seth Pettie - 2005
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
1 Parallel and Distributed Branch-and-Bound/A* Algorithms – V.-D. Cung, S. Dowaji, B. Le Cun, T. Mautor, C. Roucairol - 1994
Self-Adjusting Distributed Trees – Michael K. Reiter, Asad Samar, Chenxi Wang - 2005
§1. The Potential Framework Lecture VI Page 1 Lecture VI – unknown authors
Self-Optimizing Distributed Trees – Michael K. Reiter, Asad Samar, Goldman Sachs International, Chenxi Wang