Making data structures confluently persistent

Journal of Algorithms

Volumn 48, Issue 1, 2003, Pages 16-58

  Fiat, Amos ^a   Kaplan, Haim ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS; SET THEORY; THEOREM PROVING;

POINTERS;

DATA STRUCTURES;

EID: 0041426758     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00044-0     Document Type: Conference Paper

References (22)

1. M.A. Bender, R. Cole, E. Demaine, M. Farach-Colton, J. Zito, Two simplified algorithms for maintaining order in a list, in: Proc. 10th European Symposium on Algorithms (ESA), 2002.
2. S.W. Bent, D.D. Sleator, R.E. Tarjan, Biased search trees, SIAM J. Comput. 14 (3) (1985) 545-568.
3. A.L. Buchsbaum, R.E. Tarjan, Confluently persistant deques via data structural bootstrapping, J. Algorithms 18 (1995) 513-547.
4. B. Chazelle, How to search in history, Inform. and Control 64 (1985) 77-99.
5. R. Cole, Searching and storing similar lists, J. Algorithms 7 (1986) 202-220.
6. P.F. Dietz, Fully persistent arrays, in: Proc. 1989 Workshop on Algorithms and Data Structures (WADS'89), in: Lect. Notes in Comput. Sci., Vol. 382, Springer, 1995, pp. 67-74.
7. P.F. Dietz, D.D. Sleator, Two algorithms for maintaining order in a list, in: Proc. 19th Annual ACM Symposium on Theory of Computing, Springer, 1987, pp. 365-372.
8. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, Dynamic perfect hashing: upper and lower bounds, SIAM J. Comput. 23 (1994) 738-761.
9. D.P. Dobkin, J.I. Munro, Efficient uses of the past, J. Algorithms 6 (1985) 455-465.
10. J. Driscoll, D. Sleator, R. Tarjan, Fully persistent lists with catenation, J. ACM 41 (5) (1994) 943-959.
11. J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, Making data structures persistent, J. Comput. System Sci. 38 (1989) 86-124.
12. L.J. Guibas, R. Sedgewick, A diochromatic framework for balanced trees, in: Proc. 19th Annual Symposium on Foundations of Computer Science, 1978.
13. H. Kaplan, C. Okasaki, R.E. Tarjan, Simple confidently persistent catenable lists (extended abstract), SIAM J. Comput. 30 (3) (2000) 965-977.
14. H. Kaplan, R.E. Tarjan, Purely functional, real-time deques with catenation, JACM 46 (5) (1999) 577-603.
15. C. Okasaki, Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking, in: Proc. 36th Symposium on Foundations of Computer Science, IEEE, 1995, pp. 646-654.
16. C. Okasaki, Purely functional data structures, PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, 1996.
17. C. Okasaki, The role of lazy evaluation in amortized data structures, in: Proc. of the International Conference on Functional Programming, ACM Press, 1996, pp. 62-72.
18. M.H. Overmars, Searching in the past, Parts I and II. Technical Reports RUU-CS-81-7 and RUU-CS-81-9, Department of Computer Science, University of Utrecht, Utrecht, The Netherlands, 1981.
19. N. Sarnak, Persistent data structures, PhD thesis, Department of Computer Science, New York University, 1986.
20. N. Sarnak, R.E. Tarjan, Planar point location using persistent search trees, Comm. ACM 29 (7) (1986) 669-679.
21. D. Sleator, R.E. Tarjan, Self-adjusting binary search trees, J. ACM 32 (1985) 652-686.
22. R.E. Tarjan, Data Structures and Network Algorithms, in: SIAM CBMS, Vol. 44, 1983.