|
196
|
Functional Data Structures
– Chris Okasaki
- 1996
|
|
23
|
Persistent lists with catenation via recursive slow-down
– Robert E Tarjan
- 1995
|
|
16
|
A.A.: A programming and problem-solving seminar
– D E Knuth, Miller
- 1981
|
|
22
|
Tarjan, Fully persistent lists with catenation
– J R Driscoll, D D Sleator, R E
- 1994
|
|
11
|
Functional Binomial Queues
– David King
- 1994
|
|
160
|
Planar point location using persistent search trees
– Neil Sarnak, Robert E Tarjan
- 1986
|
|
28
|
Worst-Case Efficient Priority Queues
– Gerth Stølting Brodal, Gerth St��lting Brodal
- 1996
|
|
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
|
|
30
|
Fully persistent arrays
– P F Dietz
- 1989
|
|
231
|
Making Data Structures Persistent
– James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan
- 1989
|
|
16
|
Purely Functional Representations of Catenable Sorted Lists.
– Haim Kaplan, Robert E. Tarjan
- 1996
|
|
36
|
Implementation and analysis of binomial queue algorithmms
– M Brown
- 1978
|
|
29
|
An implicit binomial queue with constant insertion time
– S Carlsson, J I Munro, P V Poblete
- 1988
|
|
15
|
Purely Functional Random-Access Lists
– Chris Okasaki
- 1995
|
|
253
|
Introduction to Algorithms. 2nd edition
– Thomas H Cormen, Charles E Leiserson, Ronald L Rivest
- 1990
|
|
8
|
A framework for speeding up priorityqueue operations
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2004
|
|
5
|
Two new methods for transforming priority queues into double-ended priority queues
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2006
|
