|
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
|
|
84
|
A data structure for manipulating priority queues
– J Vuillemin
- 1978
|
|
493
|
Fibonacci heaps and their uses in improved network optimization algorithms
– M L Fredman, R E Tarjan
- 1987
|
|
16
|
Min-Max Heaps and Generalized Priority Queues
– M Atkinson, J R Sack, N Santoro, T Strothotte
- 1986
|
|
28
|
Worst-Case Efficient Priority Queues
– Gerth Stølting Brodal, Gerth St��lting Brodal
- 1996
|
|
47
|
The pairing heap: A new form of self-adjusting heap
– M L Fredman, R Sedgewick, D D Sleator, R E Tarjan
- 1986
|
|
29
|
An implicit binomial queue with constant insertion time
– S Carlsson, J I Munro, P V Poblete
- 1988
|
|
9
|
Double-Ended Binomial Queues
– C M Khoong, H W Leong
- 1993
|
|
43
|
Self-adjusting heaps
– D Sleater, R Tarjan
- 1986
|
|
9
|
A General Technique for Implementation of Efficient Priority Queues
– Peter Høyer
- 1994
|
|
3
|
The deap - A double ended heap to implement double ended priority queues
– S Carlsson
- 1987
|
|
126
|
Randomized Search Trees
– Raimund Seidel, Cecilia R. Aragon
- 1996
|
|
12
|
Three priority queue applications revisited
– A M Liao
- 1992
|
|
21
|
Linear lists and priority queues as balanced binary trees
– Clark Allan Crane
- 1972
|
|
9
|
The deap—A double-ended heap to implement double-ended priority queues
– S Carlsson
- 1987
|
|
2
|
Pandu Rangan. Symmetric Min-Max heap: A simpler data structure for double-ended priority queue
– A Arvind, C
- 1999
|
|
3
|
A Note on Worst Case Efficient Meldable Priority Queues
– Rolf Fagerberg
- 1996
|
|
113
|
Fundamental Algorithms, volume 1 of The Art of Computer Programming, chapter 2.2.6
– D E Knuth
- 1997
|
|
12
|
A balanced tree scheme for meldable heaps with updates
– G Peterson
- 1987
|
