Simple confluently persistent catenable lists

SIAM Journal on Computing

Volumn 30, Issue 3, 2000, Pages 965-977

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

^a TEL AVIV UNIVERSITY   (Israel)

^b Columbia University ^*  (United States)

^c Princeton University   (United States)

^d Intertrust Technologies Corporation   (United States)

Author keywords

Data structures; Double ended queue (deque); Functional programming; Memoization; Persistent data structures; Queue; Stack; Stack ended queue (steque)

Indexed keywords

COMPUTER PROGRAMMING; LISP (PROGRAMMING LANGUAGE); QUEUEING THEORY;

CATENABLE LISTS; FUNCTIONAL PROGRAMMING;

DATA STRUCTURES;

EID: 0034934546     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798339430     Document Type: Article

References (18)

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. Comput., 24 (1995), pp. 1190-1206.
2. A. L. BUCHSBAUM AND R. E. TARJAN, Confluently persistent deques via data structural bootstrapping, J. Algorithms, 18 (1995), pp. 513-547.
3. P. F. DIETZ, Fully persistent arrays, in Proceedings of the 1989 Workshop on Algorithms and Data Structures (WADS'89), Lecture Notes in Comput. Sci. 382, Springer-Verlag, New York, 1995, pp. 67-74.
4. J. DRISCOLL, D. SLEATOR, AND R. TARJAN, Fully persistent lists with catenation, J. ACM, 41 (1994), pp. 943-959.
5. J. R. DRISCOLL, N. SARNAK, D. SLEATOR, AND R. TARJAN, Making data structures persistent, J. Comput. System Sci., 38 (1989), pp. 86-124.
6. H. GAJEWSKA AND R. E. TARJAN, Deques with heap order, Inform. Process. Lett., 12 (1986), pp. 197-200.
7. R. HOOD, The Efficient Implementation of Very-High-Level Programming Language Constructs, Ph.D. thesis, TR 82-503, Department of Computer Science, Cornell University, Ithaca, NY, 1982.
8. H. KAPLAN, Purely Functional Lists, Ph.D. thesis, Department of Computer Science, Princeton University, Princeton, NJ, 1997.
9. H. KAPLAN, C. OKASAKI, AND R. E. TARJAN, Simple confluently persistent catenable lists (extended abstract), in Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT), Stockholm, Sweden, Springer-Verlag, New York, 1998, pp. 119-130.
10. H. KAPLAN AND R. E. TARJAN, Purely functional, real-time deques with catenation, J. ACM, 46 (1999), pp. 577-603.
11. H. KAPLAN AND R. E. TARJAN, Persistent lists with catenation via recursive slow-down (preliminary version), in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, NV, ACM Press, New York, 1995, pp. 93-102.
12. 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, Philadelphia, ACM Press, New York, 1996, pp. 202-211.
13. S. R. KOSARAJU, An optimal RAM implementation of catenable min double-ended queues, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, SIAM, Philadelphia, 1994, pp. 195-203.
14. C. OKASAKI, Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking, in Proceedings of the 36th Symposium on Foundations of Computer Science, Milwaukee, WI, IEEE, Piscataway, NJ, 1995, pp. 646-654.
15. C. OKASAKI, Simple and efficient purely functional queues and deques, J. Funct. Progamming, 5 (1995), pp. 583-592.
16. C. OKASAKI, Purely functional data structures, Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1996.
17. R. E. TARJAN, Amortized computational complexity, SIAM J. Alg. Discrete Methods, 6 (1985), pp. 306-318.
18. R. E. TARJAN AND J. V. LEEUWEN, Worst case analysis of set union algorithms, J. ACM, 31 (1984), pp. 245-281.