Purely Functional, Real-Time Deques with Catenation (1999)

by Haim Kaplan , Robert E. Tarjan
Venue:Journal of the ACM
Citations:13 - 2 self

Documents Related by Co-Citation

11 Simple Confluently Persistent Catenable Lists – Haim Kaplan, Chris Okasaki, Robert E. Tarjan - 1998
33 Fully persistent arrays – P F Dietz - 1989
226 Functional Data Structures – Chris Okasaki - 1996
13 lazy evaluation, and persistence: Lists with catenation via lazy linking – Amortization - 1995
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
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
156 Two algorithms for maintaining order in a list – P Dietz, D Sleator - 1987
16 Purely Functional Representations of Catenable Sorted Lists. – Haim Kaplan, Robert E. Tarjan - 1996
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
24 R.: Persistence, amortization and randomization – P Dietz, Raman - 1991
21 Efficient uses of the past – D P Dobkin, J I Munro - 1980
49 Searching and storing similar lists – R Cole - 1986
4 How to search in history. Information and Control – B Chazelle - 1985
174 Tarjan, Planar point location using persistent search trees – N Sarnak, R E - 1986
10 Making Data Structures Confluently Persistent – Amos Fiat, Haim Kaplan, Albert Einstein - 2001
26 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