|
23
|
Persistent lists with catenation via recursive slow-down
– Robert E Tarjan
- 1995
|
|
196
|
Functional Data Structures
– Chris Okasaki
- 1996
|
|
231
|
Making Data Structures Persistent
– James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan
- 1989
|
|
22
|
Tarjan, Fully persistent lists with catenation
– J R Driscoll, D D Sleator, R E
- 1994
|
|
30
|
Fully persistent arrays
– P F Dietz
- 1989
|
|
49
|
Design and analysis of a data structure for representing sorted lists
– M R Brown, R E Tarjan
- 1980
|
|
15
|
Confluently Persistent Deques via Data-Structural Bootstrapping
– Adam L. Buchsbaum, Robert E. Tarjan
- 1993
|
|
12
|
lazy evaluation, and persistence: lists with catenation via lazy linking
– Okasaki C Amortization
- 1995
|
|
24
|
Simple and efficient purely functional queues and deques
– Chris Okasaki
- 1995
|
|
15
|
Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues
– Adam L. Buchsbaum, Rajamani Sundar, Robert E. Tarjan
- 1992
|
|
2173
|
The Design and Analysis of Computer Algorithms
– A V Aho, J E Hopcroft, J D Ullman
- 1974
|
|
160
|
Planar point location using persistent search trees
– Neil Sarnak, Robert E Tarjan
- 1986
|
|
12
|
Purely Functional, Real-Time Deques with Catenation
– Haim Kaplan, Robert E. Tarjan
- 1999
|
|
334
|
Self-adjusting binary search trees
– D D AND TARJAN SLEATOR, R E
- 1985
|
|
7
|
Leeuwen, "Worst case analysis of set union algorithms
– R E Tarjan, J van
- 1984
|
|
10
|
Simple Confluently Persistent Catenable Lists
– Haim Kaplan, Chris Okasaki, Robert, Robert E. Tarjan
- 1998
|
|
22
|
Deques with heap order
– H Gajewska, R E Tarjan
- 1986
|
|
16
|
A.A.: A programming and problem-solving seminar
– D E Knuth, Miller
- 1981
|
|
12
|
Partially Persistent Data Structures of Bounded Degree with Constant Update Time
– Gerth Stølting Brodal, Gerth Stlting Brodal
- 1996
|
