Haim Kaplan
Robert E. Tarjan
- 1.G. S. Brodal. Fast meldable priority queues. In Proceedings of the ~th International Workshop on Algorithms and data structures (WADS'95), pages 282-290. Springer, 1995. LNCS 955. Google Scholar
Digital Library
- 2.G. S. Brodal and C. Okaza~. Optimal purely functional priority queues, manuscript, 1995.Google Scholar
- 3.G.S. Brodal. Worst case priority queues. In Proc. 7th annual ACM-SIAM Symposium on Discrete Alyorithms (SODA 96), pages 52-58. ACM Press, 1996. Google ScholarDigital Library
- 4.M. R. Brown and R. E. Tarjan. Design and analysis of a data ~tructu~ for rcprcacr~ing sorted lists. SIAM J. Gomp~ting, 9(3):594-614, 1980.Google ScholarCross Ref
- 5.A. L. Buchsbaum and R. E. Tarjan. Confiuently persistant deques via data structural bootstrapping. J. of Algorithms, 18:513-547, 1995. Google ScholarDigital Library
- 6.B. Chazelle. How to search in history. In. formation and control, 64:77-99, 1985. Google ScholarDigital Library
- 7.B. Chazelle and L. J. Guibas. Fractional cascading: I. a data structure technique. Algorithmica, 1(2):133-162, 1986.Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 9.R. Cole. Searching and storing similar lists. J. o} Algorithms, 7:202-220, 1986. Google ScholarDigital Library
- 10.P. F. Diets. Fully persistent arrays. In Proceedings of the 1989 Workshop on AI#orithms and Data Structures (WADS'89), pages 67-74. Springer, 1995. LNCS 382. Google ScholarDigital Library
- 11.D. P. Dobkin and J. I. Munro. Efficient uses of the past. J. o.f Algorithms, 6:455-465, 1985.Google Scholar
- 12.J. Driscoll, D. Sleator, and R. Tarjan. Fully persistent lists with catenaticaa. Journal of the A CM, 41(5):943-959, 1994. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 14.M. Felleisen. The theory and practice of first-class prompts. In Proc. 15th A CM Symposium on Principles of Programmin~ Languages, pages 180-190, 1988. Google ScholarDigital Library
- 15.M. Felleisen, M. Wand, D. P. Friedmart, 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. Google ScholarDigital Library
- 16.L. J. Guibas, E. M. McCreight, M. F. Plass, and J. R. Roberts. A new representation for linear lists. In Proc. o} the 9th Annual A CM Symposium on Theory of computing, pages 49-60. ACM Press, 1977. Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 19.H. Kaplan and R. E. Tarjan. Persistent lists with catenation via recursive slow-down. In Proceedings o} the 27th Annual A CM Symposium on Theory of Computing, pages 93-102. ACM Press, 1995. Google ScholarDigital Library
- 20.S. R. Kosaraju. Localized search in sorted fists. In Proc. i.tth A CM Symposium on Theory of Computing, pages 62- 69, 1981. Google ScholarDigital Library
- 21.S. R. Kosaraju. An optimal RAM implementation of catenable rain double-ended queues. In Proc. 5th A CM-SIAM Symposium on Discrete Algorithms, pages 195-203, 1994. Google ScholarDigital Library
- 22.K. Mehlhorn. Data structures and e~cient algorithms, Volume 1: Sorting and Searching. Springer-Verlag, Berlin, 1984.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 25.M. H. Overmars. Searching in the past, II: General transforms. Technical Report RUU-CS-81-9, Department of Computer Science, University of Utrecht, Utre~tt, The Netherlands, 1981.Google Scholar
- 26.T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language based editors. A CM Transactions on Programming Languages and Systems, 5:449-477, 1983. Google ScholarDigital Library
- 27.N. Sarnak. Persistent Data Structures. PhD thesis, Dept. of Computer Science, New York University, 1986. Google ScholarDigital Library
- 28.N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Communications o} the A CM, 29(7):669-679, 1986. Google ScholarDigital Library
- 29.D. Sitaram and M. Felleisen. Control delirrdters and their hierarchies. LISP and Symbolic Computation: An International Journal, 3:67-99, 1990. Google ScholarDigital Library
- 30.Hans-JSrg Stoss. K-band simulation yon k-kopf-turingmaschinen. Computing, 6(3):309-317, 1970.Google ScholarCross Ref
- 31.R. E. Tarjan and C. J. Van Wyk. An O(v. loglogn)-time algorithm for triangulating a simple polygon. Siam J. Computing, 17(1):143-173, 1988. Google ScholarDigital Library
- 32.A. K. Tsakalidis. An optimal implementation for localized search. Technical Report A84/06, Fachberdch Angewante Mathematic und Informatik, Universitat des Sauriandes, Saarbruclmn, West Germany, 1984.Google Scholar
- 33.A. K. TsakalJdis. Avl-trees for localized search. In.formation and Control, 67:173-194, 1985. Google ScholarDigital Library
- 34.A. K. Tsakalidis. A simple implementation for localized search. Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece, 1990.Google Scholar
Index Terms
- Purely functional representations of catenable sorted lists
Recommendations
Purely functional, real-time deques with catenation
We describe an efficient, purely functional implementation of deques with catenation. In addition to being an intriguing problem in its own right, finding a purely functional implementation of catenable deques is required to add certain sophisticated ...
Comments