Purely functional representations of catenable sorted lists

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 202-211

  Kaplan, Haim ^a   Tarjan, Robert E ^a,b  

^a Princeton University   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA STRUCTURES; FORESTRY; LISP (PROGRAMMING LANGUAGE); STRUCTURES (BUILT OBJECTS); ALGORITHMS; COMPUTER PROGRAMMING; DATA PROCESSING; DATA REDUCTION;

AND SPLITS; CONSTANT TIME; FAST IMPLEMENTATION; FUNCTIONAL LANGUAGES; ITS EFFICIENCIES; PURELY FUNCTIONAL; SEARCH TREES; TIME BOUND;

FUNCTIONAL PROGRAMMING; DATA STRUCTURES;

CATENABLE SORTED LISTS; PURELY FUNCTIONAL REPRESENTATION; STRUCTURAL BOOTSTRAPPING;

EID: 0029703216     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237865     Document Type: Conference Paper

References (34)

1. G. S. Brodai. Fast meldable priority queues. In Proceedings of the 4th International Workshop on Algorithms and data structures (WADS'95), pages 282-290. Springer, 1995. LNCS 955.
2. G. S. Brodai and C. Okasaki. Optimal purely functional priority queues. manuscript, 1995.
3. G. S. Brodai. Worst case priority queues. In Proc. 7th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 96), pages 52-58. ACM Press, 1996.
4. M. Ft. Brown and R. E. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM J. Computing, 9(3):594-614, 1980.
5. A. L. Buchsbaum and R. E. Tarjan. Confluently persistant deques via data structural bootstrapping. J. of Algorithms, 18:513-547, 1995.
6. B. Chazelle. How to search in history. Information and control, 64:77-99, 1985.
7. B. Chazelle and L. J. Guibas. Fractional cascading: I. a data structure technique. Algorithmica, 1(2):133-162, 1986.
8. M. J. Clancy and D. E. Knuth. A programming and problemsolving seminar. Technical Report STAN-CS-77-606, Department of Computer Science, Stanford University, Palo Alto, 1977.
9. R. Cole. Searching and storing similar lists. J. of Algorithms, 7:202-220, 1986.
10. 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.
11. D. P. Dobkin and J. I. Munro. Efficient uses of the past. J. of Algorithms, 6:455-465, 1985.
12. J. Driscoll, D. Sleator, and R. Tarjan. Fully persistent lists with catenation. Journal of the ACM, 41(5):943-959, 1994.
13. J. R. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan. Making data structures persistent. J. of Computer and System Science, 38:86-124, 1989.
14. M. Felleisen. The theory and practice of first-class prompts. In Proc. 15th ACM Symposium on Principles of Programming Languages, pages 180-190, 1988.
15. M. Felleisen, M. Wand, D. P. Friedman, and B. F. Duba. Abstract continuations: a mathematical semantics for handling full functional jumps. In Proc. Conference on Lisp and Functional Programming, pages 52-62, 1988.
16. L. J. Guibas, E. M. McCreight, M. F. Plass, and J. R. Roberts. A new representation for linear lists. In Proc. of the 9th Annual ACM Symposium on Theory of computing, pages 49-60. ACM Press, 1977.
17. S. Huddleston. An efficient scheme for fast local updates in linear lists. Dept. of Information and Computer Science, University of California, Irvine, CA. unpublished manuscript, 1981.
18. G. F. Johnson and D. Duggan. Stores and partial continuations as first-class objects in a language and its environment. In Proc. 15th ACM Symposium on Principles of Programming Languages, pages 158-168, 1988.
19. H. Kaplan and R. E. Tarjan. Persistent lists with catenation via recursive slow-down. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 93-102. ACM Press, 1995.
20. S. R. Kosaraju. Localized search in sorted lists. In Proc. 14th ACM Symposium on Theory of Computing, pages 62-69, 1981.
21. S. R. Kosaraju. An optimal RAM implementation of catenable min double-ended queues. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pages 195-203, 1994.
22. K. Mehlhorn. Data structures and efficient algorithms, Volume 1: Sorting and Searching. Springer-Verlag, Berlin, 1984.
23. C. Okasaki. Amortization, lazy evaluation and purely functional catanable lists. In Proc. 36th Symposium on Foundations of Computer Science, pages 646-654. IEEE, 1995.
24. M. H. Overmars. Searching in the past, I. Technical Report RUU-CS-81-7, Department of Computer Science, University of Utrecht, Utrecht, The Netherlands, 1981.
25. M. H. Overmars. Searching in the past, II: General transforms. Technical Report RUU-CS-81-9, Department of Computer Science, University of Utrecht, Utrecht, The Netherlands, 1981.
26. T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language based editors. ACM Transactions on Programming Languages and Systems, 5:449-477, 1983.
27. N. Sarnak. Persistent Data Structures. PhD thesis, Dept. of Computer Science, New York University, 1986.
28. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Communications of the ACM, 29(7):669-679, 1986.
29. D. Sitaram and M. Felleisen. Control delimiters and their hierarchies. LISP and Symbolic Computation: An International Journal, 3:67-99, 1990.
30. Hans-Jörg Stoss. K-band simulation von k-kopf-turingmaschinen. Computing, 6(3):309-317, 1970.
31. R. E. Tarjan and C. J. Van Wyk. An O (nloglogn)-time algorithm for triangulating a simple polygon. Siam J. Computing, 17(1):143-173, 1988.
32. A. K. Tsakalidis. An optimal implementation for localized search. Technical Report A84/06, Fachbereich Angewante Mathematic und Informatik, Universitat des Saarlandes, Saarbrucken, West Germany, 1984.
33. A. K. Tsakalidis. Avl-trees for localized search. Information and Control, 67:173-194, 1985.
34. A. K. Tsakalidis. A simple implementation for localized search. Computer Technology Institute, P. O. Box 1122, 26110 Patras, Greece, 1990.