Making Data Structures Confluently Persistent (2001)

by Amos Fiat , Haim Kaplan , Albert Einstein
Citations:10 - 0 self

Documents Related by Co-Citation

250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
226 Functional Data Structures – Chris Okasaki - 1996
174 Tarjan, Planar point location using persistent search trees – N Sarnak, R E - 1986
33 Fully persistent arrays – P F Dietz - 1989
14 Partially Persistent Data Structures of Bounded Degree with Constant Update Time – Gerth Stølting Brodal, Gerth Stlting Brodal - 1996
24 R.: Persistence, amortization and randomization – P Dietz, Raman - 1991
13 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
6 The set union problem with backtracking – H Mannila, E Ukkonen - 1986
3 Signet Classic – George Orwell - 1984
281 Database Management Systems – R Ramakrishnan, J Gehrke - 2000
15 Algorithms for Klee’s rectangle problem. Unpublished manuscript – J L Bentley - 1977
15 R.E.: Amortized analysis of algorithms for set union with backtracking – J Westbrook, Tarjan - 1989
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
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
20 Tarjan, "Making data structures persistent – J R Driscoll, N Saak, D D Sleator, R E - 1986
3 Improvement of a dynamic accumulator at ICICS 07 and its application in multi-user keyword-based retrieval on encrypted data – P Wang, H Wang, J Pieprzyk - 2008
11 Design and Implementation of Verifiable Audit Trails for a Versioning File System – Zachary N. J. Peterson, Randal Burns, Giuseppe Ateniese, Stephen Bono - 2007
7 Fast Functional Lists, Hash-Lists, Deques and Variable Length Arrays – Phil Bagwell - 2002