Confluently Persistent Deques via Data-Structural Bootstrapping (1993)

Cached

Download Links

by Adam L. Buchsbaum , Robert E. Tarjan
Venue:J. of Algorithms
Citations:15 - 4 self

Documents Related by Co-Citation

250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
22 Fully persistent lists with catenation – James R Driscoll, Daniel D K Sleator, Robert E Tarjan - 1994
25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
33 Fully persistent arrays – P F Dietz - 1989
13 Persistent data structures – Neil Ivor Sarnak - 1986
226 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
25 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
13 lazy evaluation, and persistence: Lists with catenation via lazy linking – Amortization - 1995
22 Deques with heap order – H Gajewska, R E Tarjan - 1986
11 Simple Confluently Persistent Catenable Lists – Haim Kaplan, Chris Okasaki, Robert E. Tarjan - 1998
49 Searching and storing similar lists – R Cole - 1986
58 Abstract continuations: A mathematical semantics for handling full functional jumps – M Felleisen, M Wand, D P Friedman, B F Duba - 1988
13 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
138 Amortized computational complexity – R E Tarjan - 1985
35 Efficient Applicative Data Types – E W Myers - 1984
11 Data Structures and Amortized Complexity in a Functional Setting – Berry Schoenmakers - 1992
39 Control delimiters and their hierarchies – Dorai Sitaram, Matthias Felleisen - 1990