|
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
|
|
30
|
Pairing heaps: experiments and analysis
– J Stasko, J Vitter
- 1987
|
|
493
|
Fibonacci heaps and their uses in improved network optimization algorithms
– M L Fredman, R E Tarjan
- 1987
|
|
84
|
A data structure for manipulating priority queues
– J Vuillemin
- 1978
|
|
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 Peterson
- 1987
|
|
67
|
Tarjan, “Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation
– J R Driscoll, H N Gabow, R Shrairman, R E
- 1988
|
|
20
|
The pairing heap: a new form of self adjusting heap, Algorithmica 1(1
– M Fredman, R Sedgewick, D Sleator, R Tarjan
- 1986
|
|
38
|
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
|
|
9
|
Two-tier relaxed heaps
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2006
|
|
129
|
Amortized computational complexity
– R E Tarjan
- 1985
|
|
2
|
Thin Heaps, Thick Heaps
– Haim Kaplan, Robert E. Tarjan
- 2006
|
|
27
|
Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms
– L Michael
- 1987
|
|
3
|
Quake heaps: a simple alternative to Fibonacci heaps
– Timothy M Chan
- 2009
|
|
43
|
Self-adjusting heaps
– D Sleater, R Tarjan
- 1986
|
|
81
|
An empirical comparison of priority-queues and event-set implementations
– D Jones
- 1986
|
