An experimental analysis of change propagation in dynamic trees

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2005, Pages 41-54

  Acar, Umut A ^a   Blelloch, Guy E ^b   Vittes, Jorge L ^c  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b Carnegie Mellon University   (United States)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANGE PROPAGATION; TREE-CONTRACTION;

ALGORITHMS; FUNCTIONS; MAINTENANCE;

DATA STRUCTURES;

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

References (21)

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, R. Harper, J. L. Vittes, and M. Woo. Dynamizing static algorithms with applications to dynamic trees and history independence. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 524-533, 2004.
3. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Minimizing diameters of dynamic trees. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming, pages 270-280, 1997.
4. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Maintaining information in fully-dynamic trees with top trees, 2003. The Computing Research Repository (CoRR)[cs.DS/0310065].
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. D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook, chapter 8. CRC Press, 1999.
7. G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM Journal of Computing, 26:484-538, 1997.
8. G. N. Frederickson. A data structure for dynamically maintaining rooted trees. Journal Algorithms, 24(1):37-65, 1997.
9. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. Journal of the ACM (JACM), 35(4):921-940, 1988.
10. M. T. Goodrich and R. Tamassia. Dynamic trees and dynamic point location. SIAM Journal of Computing, 28(2):612-636, 1998.
11. M. R. Henzinger and V. King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM (JACM), 46(4):502-516, 1999.
12. J. Holm, K. de Lichtenberg, and M. Thorup. Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM (JACM), 48 (4):723-760, 2001.
13. D. Micciancio. Oblivious data structures: applications to cryptography. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 456-464, 1997.
14. 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.
15. 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.
16. T. Radzik. Implementation of dynamic trees with in-subtree operations. A CM Journal of Experimental Algorithms, 3:9, 1998.
17. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-391, 1983.
18. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM (JACM), 32(3):652-686, 1985.
19. R. Tarjan and R. Werneck. Self-adjusting top trees. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
20. R. E. Tarjan. Dynamic trees as search trees via euler tours, applied to the network simplex algorithm. Mathematical Programming, 78:167-177, 1997.
21. R. Werneck. Princeton University.