Towards a Final Analysis of Pairing Heaps (2005)

Cached

Download Links

by Seth Pettie
Citations:10 - 1 self

Documents Related by Co-Citation

14 On the efficiency of pairing heaps and related data structures – M L Fredman - 1999
31 Pairing heaps: Experiments and analysis – J T Stasko, Jeffrey S Vitter - 1987
48 The pairing heap: A new form of self-adjusting heap – M L Fredman, R Sedgewick, D D Sleator, R E Tarjan - 1986
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
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
17 Improved upper bounds for pairing heaps – J Iacono - 2000
46 Self adjusting heaps – D D Sleator, R E Tarjan - 1986
5 Pairing heaps with O(log log n) decrease cost – Amr Elmasry - 2009
138 Amortized computational complexity – R E Tarjan - 1985
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
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
3 A priority queue transform – M Fredman - 1999
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006