J R Driscoll
R E Tarjan
- 1.R. Bayer and E. MeCreight, "Organization of large ordered indexes," Acta Informatica 1 (1972), 173- 189.Google Scholar
Digital Library
- 2.J .L . Bentley and J. B. Saxe, "Decompositional searching problems I: static-to-dynamic transformations," J. Algorithms 1 (1980), 301-358.Google ScholarCross Ref
- 3.N. Blum and K. Mehlhorn, "On the average number of rebalancing operations in weightbalanced trees," Theoretical Computer Science 11 (1980), 303-320.Google ScholarCross Ref
- 4.M.R. Brown and R. E. Tarjan, "Design and analysis of a data structure for representing sorted lists," SIAM J. Comput., 9 (1980), 594-614.Google ScholarDigital Library
- 5.B. Chazelle, "Filtering search: a new approach to query-answering," Proc 24 th Annual IEEE Symp. on Foundations of Computer Science (1983), 122- 132.Google Scholar
- 6.B. Chazelle, "How to search in history," Information and Control, to appear. Google ScholarDigital Library
- 7.B. Chazelle and L. J. Guibas, "Fractional cascading: a data structuring technique with geometric applications (extended abstract)," Automata, Languages, and Programming, 12 th Colloquium, W. Brauer ed., Lecture Notes in Computer Science, 194, Springer-Verlag, Berlin (1985) 90-100. Google ScholarDigital Library
- 8.B. Chazelle and L. J. Guibas, "Fractional cascading I: a data structuring technique," to appear.Google Scholar
- 9.R. Cole, "Searching and storing similar lists," J. Algorithms, to appear. Google ScholarDigital Library
- 10.P. Dietz, "Maintaining order in a linked list, Proc. 14 th Annual ACM Symp. on Theory of Computing (1982), 62-69. Google ScholarDigital Library
- 11.D. P. Dobkin and J. I. Munro, "Efficient uses of the past," Proc. 21 n Annual IEEE Symp. on Foundations of Computer Science (1980), 200-206.Google Scholar
- 12.L. J. Guibas and R. Sedgewiclq "A dichromatic framework for balanced trees," Proc. 19 th Annual IEEE Syrup. on Foundations of Computer Science (1978), 8-21.Google Scholar
- 13.R. Hood and R. Melville, "Real-time queue ol~rations in pure LISP," Inform. Process. Lett. t3 (1981), 50-54.Google Scholar
- 14.S. Huddleston and K. Mehlhorn, "Robust balancing in B-trees," Theoretical Computer Science VII, P. Deussens, exl., Lecture Notes in Computer Science 104, Springer-Verlag, Berlin (1981), 234-244. Google ScholarDigital Library
- 15.S. Huddleston and K. Mehlhorn, "A new data structure for representing sorted lists," Acta Informatica 17 (1982), 157-184.Google ScholarDigital Library
- 16.S. Huddleston, "An efficient scheme for fast local updates in linear lists," Dept. of Information and Computer Science, University of California, irvine, CA, 1981.Google Scholar
- 17.S. R. Kosaraju, "Localized search in sorted lists," Proc. 13 th Annual ACM Syrup. on Theory of Computing (1981), 62-69. Google ScholarDigital Library
- 18.T. Krijnen and L. G. L. T. Meertens, "Making B- trees work for B," IW 219/83, The Mathematical Centre, Amsterdam, The Netherlands, 1983.Google Scholar
- 19.D. Maier and S. C. Salveter, "Hysterical B-trees," Inform. Process. Lett. 12 (1981), 199-202.Google ScholarCross Ref
- 20.E. W. Meyers, "AVL dags," TR 82-9, Dept. of Computer Science, The University of Arizona, Tucson, AZ, 1982.Google Scholar
- 21.E. W. Myers, "An applicative random-access stack," Inform. Process. Lett. 17 (1983), 241-248.Google ScholarCross Ref
- 22.E. W. Myers, "Efficient applicative data types," Conf. Record Elecenth Annual ACM Syrup. on Principles of Programming Languages (1984), 66- 75. Google ScholarDigital Library
- 23.J. Nievergelt and E. M. Reingold, "Binary search trees of bounded balance," SIAM J. Comput. 2 (1973), 33-43.Google ScholarDigital Library
- 24.M. H. Overmars, "Searching in the past I," Information and Control, to appear.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, Utrecht, The Netherlands, 1981.Google Scholar
- 26.T. Reps, T. Teitelbaum, and A. Demers, "Incremental context-dependent analysis for languagebased editors," ACM Trans. on Prog. Sys. and Lang. 5(193), 449-477. Google ScholarDigital Library
- 27.N. Sarnak, "Persistent data structures," Ph.D. Thesis, Dept. of Computer Science, New York University, New York, NY, to apepar. Google ScholarDigital Library
- 28.N. Sarnak and R. E. Tarjan, "Planar point location using persistent search trees," Comm. ACM, to appear. Google ScholarDigital Library
- 29.D.D. Sleator, "An improved method for maintaining order in a list,"to appear.Google Scholar
- 30.G. F. Swart, "Efficient algorithms for computing geometric intersections," Technical Report #85- 01-02, Department of Computer Science, University of Washington, Seattle, WA, 1985.Google Scholar
- 31.R.E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983. Google ScholarDigital Library
- 32.R.E. Tarjan, "Updating a balanced search tree in O(1) rotations," Inform. Process. Lett. 16 (1983), 253-257.Google ScholarCross Ref
- 33.R. E. Tarjan, "Amortized computational complexity," SIAM J. Alg. Disc. Meth. 6 (1985), 306-318.Google ScholarDigital Library
- 34.A.K. Tsakalidis, "Maintaining order in a generalized linked list," Acta Informatica 21 (1984), 101- 112. Google ScholarDigital Library
- 35.A.K. Tsakalidis, "AVL-trees for localized search," Automata, Languages, and Programming, 11 th Colloquium, J. Paredaens, ed., Lecture Notes in Computer Science 172, Springer-Verlag, Berlin (1984), 473-485. Google ScholarDigital Library
- 36.A K. Tsakalidis, "An optimal implementation for localized search," A 84/06, Fachbereich Angewandte Mathematik und Informatik, Universit//t des Saarlandes, Saarbriicken, West Germany, 1984.Google Scholar
Index Terms
- Making data structures persistent
Recommendations
Making data structures confluently persistent
Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithmsWe address a longstanding open problem of [J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, J. Comput. System Sci. 38 (1989) 86-124, J. Driscoll, D. Sleator, R. Tarjan, J. ACM, 41 (5) (1994) 943-959], and present a general transformation that transforms ...
Making data structures confluently persistent
SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithmsWe address a longstanding open problem of [8, 7], and present a general transformation that takes any data structure and transforms it to a confluently persistent data structure. We model this general problem using the concepts of a version DAG (...
Comments