|
15
|
Confluently Persistent Deques via Data-Structural Bootstrapping
– Adam L. Buchsbaum, Robert E. Tarjan
- 1993
|
|
231
|
Making Data Structures Persistent
– James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan
- 1989
|
|
23
|
Persistent lists with catenation via recursive slow-down
– Robert E Tarjan
- 1995
|
|
9
|
Postorder disjoint set union is linear
– Joan M Lucas
- 1990
|
|
22
|
Tarjan, Fully persistent lists with catenation
– J R Driscoll, D D Sleator, R E
- 1994
|
|
24
|
Simple and efficient purely functional queues and deques
– Chris Okasaki
- 1995
|
|
22
|
Deques with heap order
– H Gajewska, R E Tarjan
- 1986
|
|
9
|
Linearity and unprovability of set union problem strategies. I. Linearity of strong postorder
– M Loebl, J Ne˘set˘ril
- 1997
|
|
16
|
Purely Functional Representations of Catenable Sorted Lists.
– Haim Kaplan, Robert E. Tarjan
- 1996
|
|
30
|
Fully persistent arrays
– P F Dietz
- 1989
|
|
129
|
Amortized computational complexity
– R E Tarjan
- 1985
|
|
196
|
Functional Data Structures
– Chris Okasaki
- 1996
|
|
48
|
Searching and storing similar lists
– R Cole
- 1986
|
|
142
|
Fractional cascading: I. A data structuring technique
– Bernard Chazelle, Leonidas J. Guibas
- 1986
|
|
102
|
Leeuwen. Worst-case analysis of set union algorithms
– R E Tarjan, J Van
- 1984
|
|
334
|
Self-adjusting binary search trees
– D D AND TARJAN SLEATOR, R E
- 1985
|
|
11
|
Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming
– Tyng-Ruey Chuang, Benjamin Goldberg
- 1993
|
|
4
|
An Optimal RAM Implementation of Catenable Min Double-ended Queues
– S R Kosaraju
- 1994
|
|
12
|
lazy evaluation, and persistence: lists with catenation via lazy linking
– Okasaki C Amortization
- 1995
|
