Purely functional, real-time deques with catenation

Journal of the ACM

Volumn 46, Issue 5, 1999, Pages 577-603

  Kaplan, Haim ^a,b,f   Tarjan, Robert E ^c,d,e  

^a AT AND T LABS RESEARCH   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c InterTmst Technologies   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

^e Princeton University   (United States)

^f Intertrust Technologies Corporation   (United States)

Author keywords

Catenation; Data structures; Double ended queue; Persistent data structures; Purely functional data structures; Purely functional queues; Queue; Stack

Indexed keywords

CATENATION; DOUBLE-ENDED QUEUE; PERSISTENT DATA STRUCTURES; PURELY FUNCTIONAL DATA STRUCTURES; PURELY FUNCTIONAL QUEUES; QUEUE; STACK;

COLOR; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; FUNCTIONS; PROBLEM SOLVING; QUEUEING NETWORKS;

REAL TIME SYSTEMS;

EID: 0004576201     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/324133.324139     Document Type: Article

References (45)

1. ALLEN, J. 1978. Anatomy of LISP. McGraw-Hill Computer Science Series. McGraw-Hill, New York.
2. BRODAL, G. S. 1996. Worst-case efficient priority queues. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 52-58.
3. BUCHSBAUM, A. L., SUNDAR, R., TARJAN, R. E. 1995. Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues. SIAM J. Computing 24, 6, 1190-1206.
4. BUCHSBAUM, A. L., TARJAN, R. E. 1995. Confluently persistant deques via data structural bootstrapping. J. Algorithms 18, 513-547.
5. BURTON, F. W. 1982. An efficient functional implementation of FIFO queues. Inf. Proc. Lett. 14, 5, 205-206.
6. CHAZELLE, B. 1985. How to search in history. Inf. Control 64, 77-99.
7. CHAZELLE, B., GUIBAS, L. J. 1986. Fractional cascading: I. a data structuring technique. Algorithmica I, 2, 133-162.
8. CHUANG, T.-R., GOLDBERG, B. 1993. Real-time deques, multihcad luring machines, and purely functional programming. In Proceedings of the Conference on Functional Programming and Computer Architecture. (Copenhagen). ACM, New York, pp. 289-298.
9. CLANCY, M. J., KNUTH, D. E. 1977. A programming and problem-solving seminar. Tech. Rep. STAN-CS-77-606. Department of Computer Science, Stanford University, Palo Alto, Calif.
10. COLE, R. 1986. Searching and storing similar lists. J. Algorithms 7, 202-220.
11. DIETZ, P. F. 1995. Fully persistent arrays. In Proceedings of the 1989 Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science. Springer-Verlag, New York, pp. 67-74.
12. DOBKIN, D. P., MUNRO, J. I. 1985. Efficient uses of the past. J. Algorithms 6, 455-465.
13. DRISCOLL, J. R., SARNAK, N., SLEATOR, D., TARJAN, R. 1989. Making data structures persistent. J. Comput. Syst. Sci. 38, 86-124.
14. DRISCOLL, J., SLEATOR, D., TARJAN, R. 1994. Fully persistent lists with catenation. J. ACM 41, 5 (Sept.), 943-959.
15. FELLEISEN, M. 1988. The theory and practice of first-class prompts. In Proceedings of the 15th ACM Symposium on Principles of Programming Languages (San Diego, Calif., Jan. 15-17). ACM, New York, pp. 180-190.
16. FELLEISEN, M., WAND, M., FRIEDMAN, D. P., DUBA, B. F. 1988. Abstract continuations: A mathematical semantics for handling full functional jumps. In Proceedings of the Conference on Lisp and Functional Programming (Snowbird, Ut., July 25-27). ACM, New York, pp. 52-62.
17. FISHER, P. C., MEYER, A. R., ROSENBERG, A. L. 1972. Real-time simulation of multihead tape units. J. ACM 19, 4 (Oct.), 590-607.
18. FREDERICKSON, G. N. 1993. Optimal selection in a min-heap. ///J. Comput. 104, 197-214.
19. GAJEWSKA, H., TARJAN, R. E. 1986. Deques with heap order. Inf. Proc. Lett. 12, 4, 197-200.
20. GRIES, D. 1981. The Science of Programming. In Texts and Monographs in Computer Science. Springer-Verlag, New York.
21. HOOD, R. 1982. The efficient implementation of very-high-level programming language constructs. Ph.D. dissertation. Dcpt. of Computer Science, Cornell Univ. Ithaca, N.Y.
22. HOOD, R., MELVILLE, R. 1981. Real-time queue operations in pure Lisp. Inf. Proc. Lett. 13, 50-54.
23. HOOGERWOOD, R. R. 1992. A symmetric set of efficient list operations. J. Fund. Prog. 2, 4, 505-513.
24. JOHNSON, G. F., DUGGAN, D. 1988. Stores and partial continuations as first-class objects in a language and its environment. In Proceedings of the 15th ACM Symposium on Principles of Programming Languages (San Diego, Calif., Jan. 15-17). ACM, New York, pp. 158-168.
25. KAPLAN, H. 1996. Purely functional lists. Ph.D. dissertation. Dept. Computer Science, Princeton Univ., Princeton, N.J.
26. KAPLAN, H., OKASAKI, C., TARJAN, R. E. 1998. Simple confluently persistent catenable lists (extended abstract). In Proceedings of the 6th Scandanavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 1432. Springer-Verlag, New York, pp. 119-130.
27. KAPLAN, H., TARJAN, R. E. 1995. Persistent lists with catenation via recursive slow-down. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 93-102.
28. KAPLAN, H., TARJAN, R. E. 1996. Purely functional representations of catenable sorted lists. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 202-211.
29. KNUTH, D. E. 1973. Fundamental Algorithms, 2nd cd. Vol. 1, The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, second edition, 1973.
30. KOSARAJU, S. R. 1979. Real-time simulation of concatenable double-ended queues by doubleended queues. In Proceedings of the llth ACM Symposium on Theory of Computing (Atlanta, Ga., Apr. 30-May 2). ACM, New York, pp. 346-351.
31. KOSARAJU, S. R. 1994. An optimal RAM implementation of catenable min double-ended queues. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 195-203.
32. LEONG, B. L., SEIFERAS, J. I. 1981. New real-time simulations of multihead tape units.J. ACM 28, 1, 166-180.
33. OKASAKI, C. 1995. Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking. In Proceedings of the 36th Symposium on Foundations of Computer Science. IEEE, New York, pp. 646-654.
34. OKASAKI, C. 1995. Simple and efficient purely functional queues and deques. J. Funct. Prog. 5, 4, 583-592.
35. OKASAKI, C. 1998. Purely functional data structures. Cambridge University Press, Cambridge, Mass.
36. OKASAKI, C. 1997. Catenable double-ended queues. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming. ACM, New York, pp. 66-74.
37. OVERMARS, M. H. 1981a. Searching in the past. I. Tech. Rep. RUU-CS-81-7. Dcpt. Computer Science, Univ. Utrecht, Utrecht, The Netherlands.
38. OVERMARS, M. H. 1981b. Searching in the past. II: General transforms. Tech. Rep. RUU-CS-81-9. Dept. Computer Science, Univ. Utrecht, Utrecht, The Netherlands.
39. SARNAK, N. 1986. Persistent data structures. Ph.D. dissertation. Dcpt. of Computer Science, New York University, New York.
40. SARNAK, N., TARJAN, R. E. 1986. Planar point location using persistent search trees. Commun. ACM 29, 7 (July), 669-679.
41. SITARAM, D., FELLEISEN, M. 1990. Control delimiters and their hierarchies. LISP and Symbolic Computation: An International Journal 3, 67-99.
42. SPITZER, J. M., LEVITT, K. N., ROBINSON, L. 1978. An example of hierarchical design and proof. Commun. ACM 21, 12 (Dec.), 1064-1075.
43. STOSS, H.-J. 1970. K-band simulation von Ar-kopf-turing-maschinen. Computing 6, 3, 309-317.
44. TARJAN, R. E. 19S5. Amortized computational complexity. SIAM J. Alg. Disc. Meth. 6, 2, 306-318.
45. TARJAN, R. E., VAN LEEUWEN, J. 1984. Worst case analysis of set union algorithms. J. ACM 31, 1 (Mar.), 245-281.