Simple confluently persistent catenable lists

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1432, Issue , 1998, Pages 119-130

  Kaplan, Haim ^a   Okasaki, Chris ^b   Tarjan, Robert E ^c,d  

^a AT AND T LABS RESEARCH   (United States)

^b Carnegie Mellon University   (United States)

^c Princeton University   (United States)

^d Intertrust Technologies Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSTANT AMORTIZED TIME; INSERTIONS AND DELETIONS; NON DESTRUCTIVE;

DATA STRUCTURES;

EID: 84957617846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054360     Document Type: Conference Paper

References (14)

1. A. L. Buchsbaum, R. Sundar, and R. E. Tarjan. Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues. SIAM J. Computing, 24(6):1190-1206, 1995.
2. A.L. Buchsbanm and R. E. Tarjan. Confluently persistant deques via data structural bootstrapping. J. of Algorithms, 18:513-547, 1995.
3. P. F. Dietz. Fully persistent arrays. In Proceedings of the 1989 Workshop on Algorithms and Data Structures (WADS’89), pages 67-74. Springer, 1995. LNCS 382.
4. J. Driscoll, D. Sleator, and R. Tarjan. Yhlly persistent lists with catenation. Journal of the ACM, 41(5):943-959, 1994.
5. J. R. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan. Making data structures persistent. J. of Computer and System Science, 38:86-124, 1989.
6. Hania Gajewska and Robert E. Tarjan. Deques with heap order. Information Processing Letters, 12(4):197-200, 1986.
7. H. Kaplan. Purely functional lists. PhD thesis, Department of Computer Science, Princeton University, Princeton, NJ 08544, 1997.
8. H. Kaplan and R. E. Tarjan. Persistent lists with catenation via recursive slowdown. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (Preliminary Version), pages 93-102. ACM Press, 1995. Complete version submitted to Journal of the ACM.
9. H. Kaplan and R. E. Tarjan. Purely functional representations of catenable sorted lists. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 202-211. ACM Press, 1996.
10. S. R. Kosaraju. An optimal RAM implementation of catenable rain double-ended queues. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pages 195-203, 1994.
11. C. Okasaki. Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking. In Proc. 36th Symposium on Foundations of Computer Science, pages 646-654. IEEE, 1995.
12. C. Okasaki. Simple and efficient purely functional queues and deques. J. Functional Progamming, 5(4):583-592, 1995.
13. C. Okasaki. Purely functional data structures. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, 1996.
14. R. E. Tarjan. Amortized computational complexity. SIAM J. Algebraic Discrete Methods, 6(2):306-318, 1985.