Retroactive Data Structures

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 274-283

  Demaine, Erik D ^a   Iacono, John ^b   Langerman, Stefan ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; GRAPH THEORY; PROBLEM SOLVING; THEOREM PROVING;

LINEAR RELATIONSHIP; RETROACTIVE STRUCTURES;

DATA STRUCTURES;

EID: 1842435923     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. J. Bentley. Algorithms for Klee's rectangle problems, unpublished manuscript, Dept. of Computer Science, Carnegie-Mellon University, 1977.
2. J. L. Bentley and J. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformations. J. Algorithms, 1:301-358, 1980.
3. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM, 48:1-12, 2001.
4. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86-124, 1989.
5. A. Fiat and H. Kaplan. Making data structures confluently persistent. In Proc. 12th Ann. Symp. Discrete Algorithms, pages 537-546, Washington, DC, January 2001.
6. R. Fleischer. A simple balanced search tree with O(1) worst-case update time. International Journal of Foundations of Computer Science, 7(2):137-149, 1996.
7. M. L. Fredman and M. E. Saks. The cell probe complexity of dynamic data structures. In Proc. of the 21st ACM Symposium on Theory of Computing, pages 345-354, May 1989.
8. H. Mannila and E. Ukkonen. The set union problem with backtracking. In Proc. 13th Int. Colloq. Automata, Languages and Programming, LNCS 226, pages 236-243, 1986.
9. G. Orwell. 1984. Signet Classic, 1949.
10. R. Ramakrishnan and J. Gehrke. Database Management Systems. McGraw-Hill, 2002.
11. R. Raman, V. Raman, and S. S. Rao. Succinct dynamic data structures. In Proc. 7th Workshop on Algorithms and Data Structures, volume 2125 of Lecture Notes in Computer Science, pages 426-437, 2001.
12. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM, 29(7):669-679, 1986.
13. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci., 26(3):362-381, 1983.
14. J. Snoeyink. Point location. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 30, pages 559-574. CRC Press LLC, Boca Raton, FL, 1997.
15. V. Strassen. Algebraic complexity theory. In J. van Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, chapter 11, pages 633-672. MIT Press, 1990.
16. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. J. ACM, 22:215-225, 1975.
17. R. E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. Syst. Sci., 18: 110-127, 1979.
18. J. Westbrook and R. E. Tarjan. Amortized analysis of algorithms for set union with backtracking. SLAM J. Comput., 18:1-11, 1989.
19. A. C. Yao. Should tables be sorted? Journal of the Association for Computing Machinery, 28(3):615-628, 1981.