|
9
|
Two-tier relaxed heaps
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2006
|
|
253
|
Introduction to Algorithms. 2nd edition
– Thomas H Cormen, Charles E Leiserson, Ronald L Rivest
- 1990
|
|
17
|
Meldable heaps and Boolean union-find
– H Kaplan, N Shafrir, R E Tarjan
- 2002
|
|
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
|
|
5
|
Two new methods for transforming priority queues into double-ended priority queues
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2006
|
|
12
|
New heap data structures
– H Kaplan, R Tarjan
- 1999
|
|
28
|
Worst-Case Efficient Priority Queues
– Gerth Stølting Brodal, Gerth St��lting Brodal
- 1996
|
|
10
|
Experiences with the design and implementation of space-efficient deques
– Jyrki Katajainen, Bjarke Buur Mortensen
- 2001
|
|
55
|
Data Structures and Algorithms in Java
– M T Goodrich, R Tamassia
- 2001
|
|
20
|
Worst-case optimal insertion and deletion methods for decomposable searching problems
– M Overmars, J van Leeuwen
- 1981
|
|
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
|
|
140
|
Algorithm 232: heapsort
– J Williams
- 1964
|
|
3
|
Relaxed weak queues: an alternative to run-relaxed heaps
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2005
|
|
2
|
Project proposal: A meldable, iterator-valid priority queue, CPH
– Jyrki Katajainen
- 2005
|
|
3
|
Putting your data structure on a diet, CPH
– H Brönnimann, J Katajainen, P Morin
- 2007
|
|
2
|
The cost of iterator validity
– N Esbensen
- 2006
|
|
2
|
Generic algorithm for 0/1-sorting, CPH
– G Franceschini, J Katajainen
- 2006
|
|
6
|
Layered heaps
– Amr Elmasry
- 2004
|
