Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues (1992)

Cached

Download Links

by Adam L. Buchsbaum , Rajamani Sundar , Robert E. Tarjan
Venue:SIAM Journal on Computing
Citations:15 - 7 self

Documents Related by Co-Citation

15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
22 Fully persistent lists with catenation – James R Driscoll, Daniel D K Sleator, Robert E Tarjan - 1994
9 Postorder disjoint set union is linear – J M Lucas - 1990
25 Simple and efficient purely functional queues and deques – Chris Okasaki - 1995
22 Deques with heap order – H Gajewska, R E Tarjan - 1986
10 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
33 Fully persistent arrays – P F Dietz - 1989
138 Amortized computational complexity – R E Tarjan - 1985
226 Functional Data Structures – Chris Okasaki - 1996
49 Searching and storing similar lists – R Cole - 1986
159 Fractional cascading: I. A data structuring technique – Bernard Chazelle, Leonidas J. Guibas - 1986
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
12 Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming – Tyng-Ruey Chuang, Benjamin Goldberg - 1993
109 Leeuwen. Worst-case analysis of set union algorithms – R E Tarjan, J van
4 An Optimal RAM Implementation of Catenable Min Double-ended Queues – S R Kosaraju - 1994
4 Purely functional lists – H Kaplan - 854