Dynamizing Static Algorithms, with Applications to Dynamic Trees and History Independence

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 524-533

  Acar, Umut A ^a   Blelloch, Guy E ^a   Harper, Robert ^a   Vittes, Jorge L ^a   Woo, Shan Leung Maverick ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HISTORY INDEPENDENCE; RAKE-AND-COMPRESS TREES (RC-TREES); STATIC PROGRAMS;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATA REDUCTION; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL PROGRAMMING; PARALLEL ALGORITHMS; THEOREM PROVING;

TREES (MATHEMATICS);

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

References (27)

1. U. A. Acar, G. E. Blelloch, and R. Harper. Adaptive functional programming. In Proceedings of the 29th Annual ACM Symposium on Principles of Programming Languages, pages 247-259, 2002.
2. U. A. Acar, G. E. Blelloch, and J. L. Vittes. Separating structure from data in dynamic trees. Technical Report CMU-CS-03-189, Department of Computer Science, Carnegie Mellon University, 2003.
3. J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. Journal of Algorithms, 31(1):1-28, 1999.
4. J. L. Bentley and J. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. Journal of Algorithms, 1(4):301-358, 1980.
5. R. F. Cohen and R. Tamassia. Dynamic expression trees and their applications. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 52-61, 1991.
6. A. Demers, T. Reps, and T. Teitelbaum. Incremental evaluation of attribute grammars with application to syntax directed editors. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages, pages 105-116, 1981.
7. P. F. Dietz. Fully persistent arrays. In Workshop on Algorithms and Data Structures, volume 382 of Lecture Notes in Computer Science, pages 67-74. Springer-Verlag, August 1989.
8. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proceedings of the 19th ACM Symposium on Theory of Computing, pages 365-372, 1987.
9. 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, Feb. 1989.
10. G. N. Frederickson. Data structures for on-line updating of minimum spanning trees, with applications. SIAM Journal on Computing, 14:781-798, 1985.
11. G. N. Frederickson. A data structure for dynamically maintaining rooted trees. Journal of Algorithms, 24(1):37-65, 1997.
12. J. D. Hartline, E. S. Hong, A. E. Modht, W. R. Pentney, and E. C. Rocke. Characterizing history independent data structures. In Proceedings of Thirteenth International Symposium on Algorithms and Computation (ISAAC), volume 2518 of Lecture Notes in Computer Science. Springer, 2002.
13. M. R. Henzinger and V. King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM, 46(4):502-516, 1999.
14. J. Holm and K. de Lichtenberg. Top-trees and dynamic graph algorithms. Technical Report DIKU-TR-98/17, Department of Computer Science, University of Copenhagen, Aug. 1998.
15. D. Micciancio. Oblivious data structures: applications to cryptography. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 456-464, 1997.
16. G. L. Miller and J. H. Reif. Parallel tree contraction and its application. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, pages 487-489, 1985.
17. G. L. Miller and J. H. Reif. Parallel tree contraction, part 2: Further applications. SIAM Journal on Computing, 20(6):1128-1147, 1991.
18. K. Mulmuley. Randomized multidimensional search trees: Lazy balancing and dynamic shuffling (extended abstract). In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, pages 180-196, 1991.
19. M. Naor and V. Teague. Anti-presistence: history independent data structures. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 492-501. ACM Press, 2001.
20. M. H. Overmars. Dynamization of order decomposable set problems. Journal of Algorithms, 2:245-260, 1981.
21. M. H. Overmars. The Design of Dynamic Data Structures. Springer, 1983.
22. W. Pugh and T. Teitelbaum. Incremental computation via function caching. In Proceedings of the 16th Annual A CM Symposium on Principles of Programming Languages, pages 315-328, 1989.
23. O. Schwarzkopf. Dynamic maintenance of geometric structures made easy. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, pages 197-206, 1991.
24. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-391, 1983.
25. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, 1985.
26. R. E. Tarjan. Dynamic trees as search trees via euler tours, applied to the network simplex algorithm. Mathematical Programming, 78:167-177, 1997.
27. M. N. Wegman and L. Carter. New classes and applications of hash functions. In Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, pages 175-182, 1979.