|
10
|
Simple Confluently Persistent Catenable Lists
– Haim Kaplan, Chris Okasaki, Robert, Robert E. Tarjan
- 1998
|
|
30
|
Fully persistent arrays
– P F Dietz
- 1989
|
|
196
|
Functional Data Structures
– Chris Okasaki
- 1996
|
|
12
|
lazy evaluation, and persistence: lists with catenation via lazy linking
– Okasaki C Amortization
- 1995
|
|
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
|
|
15
|
Confluently Persistent Deques via Data-Structural Bootstrapping
– Adam L. Buchsbaum, Robert E. Tarjan
- 1993
|
|
143
|
Two algorithms for maintaining order in a list
– P F Dietz, D D Sleator
- 1987
|
|
16
|
Purely Functional Representations of Catenable Sorted Lists.
– Haim Kaplan, Robert E. Tarjan
- 1996
|
|
231
|
Making Data Structures Persistent
– James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan
- 1989
|
|
23
|
Persistence, amortization and randomization
– P F Dietz, R Raman
- 1991
|
|
19
|
Efficient use of the past
– D P Dobkin, J I Munro
- 1980
|
|
3
|
How to search in history. Information and control
– B Chazelle
- 1985
|
|
48
|
Searching and storing similar lists
– R Cole
- 1986
|
|
160
|
Planar point location using persistent search trees
– Neil Sarnak, Robert E Tarjan
- 1986
|
|
10
|
Making Data Structures Confluently Persistent
– Amos Fiat, Haim Kaplan, Albert Einstein
- 2001
|
|
25
|
How to search in history
– B Chazelle
- 1985
|
|
9
|
Time Complexity of Programs in Type Theory
– B Bjerner
- 1989
|
|
2
|
Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman, chapter Computational Complexity and Induction for Partial Computable Functions in Type Theory. A K Peters Ltd
– Robert L Constable, Karl Crary
- 2002
|
