|
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
|
|
23
|
Persistent lists with catenation via recursive slow-down
– Robert E Tarjan
- 1995
|
|
30
|
Fully persistent arrays
– P F Dietz
- 1989
|
|
13
|
Persistent data structures
– Neil Ivor Sarnak
- 1986
|
|
196
|
Functional Data Structures
– Chris Okasaki
- 1996
|
|
15
|
Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues
– Adam L. Buchsbaum, Rajamani Sundar, Robert E. Tarjan
- 1992
|
|
24
|
Simple and efficient purely functional queues and deques
– Chris Okasaki
- 1995
|
|
16
|
Purely Functional Representations of Catenable Sorted Lists.
– Haim Kaplan, Robert E. Tarjan
- 1996
|
|
12
|
lazy evaluation, and persistence: lists with catenation via lazy linking
– Okasaki C Amortization
- 1995
|
|
22
|
Deques with heap order
– H Gajewska, R E Tarjan
- 1986
|
|
10
|
Simple Confluently Persistent Catenable Lists
– Haim Kaplan, Chris Okasaki, Robert, Robert E. Tarjan
- 1998
|
|
48
|
Searching and storing similar lists
– R Cole
- 1986
|
|
57
|
Abstract continuations: A mathematical semantics for handling full functional jumps
– Matthias Felleisen, Mitchell Wand, Daniel P Friedman, Bruce F Duba
|
|
12
|
Purely Functional, Real-Time Deques with Catenation
– Haim Kaplan, Robert E. Tarjan
- 1999
|
|
129
|
Amortized computational complexity
– R E Tarjan
- 1985
|
|
31
|
Efficient applicative data types
– Eugene W Myers
- 1984
|
|
11
|
Data Structures and Amortized Complexity in a Functional Setting
– Berry Schoenmakers
- 1992
|
|
23
|
and Partial Continuations as First-Class Objects in a Language and its Environment
– G F Johnson, D Stores Duggan
- 1988
|
