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

Documents Related by Co-Citation

14 On the efficiency of pairing heaps and related data structures – M L Fredman - 1999
10 Towards a Final Analysis of Pairing Heaps – Seth Pettie - 2005
31 Pairing heaps: Experiments and analysis – J T Stasko, Jeffrey S Vitter - 1987
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
12 New heap data structures – H Kaplan, R Tarjan - 1999
9 A General Technique for Implementation of Efficient Priority Queues – Peter Høyer - 1994
12 A balanced tree scheme for meldable heaps with updates – G L PETERSON - 1987
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
73 Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation – James R Driscoll, Harold N Gabow, Ruth Shrairman, Robert E Tarjan - 1988
86 A data structure for manipulating priority queues – J Vuillemin - 1978
20 The pairing heap: a new form of self adjusting heap, Algorithmica 1(1 – M Fredman, R Sedgewick, D Sleator, R Tarjan - 1986
40 An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree – Bernard M. E. Moret, Henry D. Shapiro - 1994
5 Parametrized self-adjusting heaps – A Elmasry
138 Amortized computational complexity – R E Tarjan - 1985
10 Theory of 2-3 Heaps – Tadao Takaoka - 1999
2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
3 Quake Heaps: A Simple Alternative to Fibonacci Heaps, 2009; available online at http://www.cs.uwaterloo.ca/∼tmchan/heap.ps – T M Chan
2 The violation heap: A relaxed Fibonacci-like heap – A Elmasry
2 Tarjan, Rank-pairing heaps – B Haeupler, S Sen, R E