Finding Dominators Revisited

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 862-871

  Georgiadis, Loukas ^a   Tarjan, Robert E ^a,b  

^a Princeton University   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL FLOW GRAPHS; RANDOM-ACCESS MACHINES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

COMPUTER SCIENCE;

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

References (16)

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman. On finding lowest common ancestors in trees. SIAM J. Comput. 5, 1, 1976, Pages 115-133, 2000.
2. A. V. Aho, R. Sethi and J. D. Ullman. Compilers: Principles, techniques and tools. Addison-Wesley, Reading, Mass., 1986.
3. S. Alstrup, D. Harel, P. W. Lauridsen and M. Thorup: Dominators in Linear Time. SIAM J. Comput. 28(6), Pages 2117-2132, 1999.
4. A. Appel. Modern compiler implementation in ML. Cambridge University Press, Cambridge, Cambridge UK, 1998.
5. M. A. Bender and M. Farach-Colton. The LCA problem revisited. LATIN, Pages 88-94, 2000.
6. A. L. Buchsbaum, H. Kaplan, A. Rogers and J. R. Westbrook. Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. STOC 1998, Pages 279-288.
7. A. L. Buchsbaum, H. Kaplan, A. Rogers and J. R. Westbrook. A New, Simpler Linear-Time Dominators Algorithm. ACM Transactions on Programming Languages and Systems 20, 6, November 1998, Pages 1265-1296.
8. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48(3), Pages 533-551, 1994.
9. H. N. Gabow. Path-based depth-first search for strong and biconnected components. Information Processing Letters 74, 2000, Pages 107-114.
10. H. N. Gabow and R. E. Tarjan. A Linear-Time Algorithm for a Special Case of Disjoint Set Union. JCSS 30(2), Pages 209-221, 1985.
11. D. Harel. A linear time algorithm for finding dominators in flow graphs and related problems. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, Pages 185-194, May 1985.
12. D. Harel and R. E. Tarjan. Fast Algorithms for Finding Nearest Common Ancestors. SIAM J. Comput. 13(2), Pages 338-355, 1984.
13. T. Lengauer and R. E. Tarjan, A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1, 1, 1979, Pages 121-141.
14. B. Schieber and U. Vishkin. On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Comput. 17(6), Pages 1253-1262, 1988.
15. R. E. Tarjan, Depth-first search and linear graph algorithms. SIAM J. Comput., 1,(2), Pages 146-160, 1972.
16. R. E. Tarjan, Applications of path compression on balanced trees. J. ACM 26, 4, 1979, Pages 690-715.