Dominators in Linear Time

Dominators in Linear Time (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Stephen Alstrup , Dov Harel , Peter W. Lauridsen , Mikkel Thorup

Citations:

23 - 0 self

BibTeX

@MISC{Alstrup97dominatorsin,
    author = {Stephen Alstrup and Dov Harel and Peter W. Lauridsen and Mikkel Thorup},
    title = {Dominators in Linear Time},
    year = {1997}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

A linear time algorithm is presented for finding dominators in control flow graphs.

Citations

801	Depth-first search and linear graph algorithms - Tarjan - 1972
749	Efficiently computing static single assignment form and the control dependence graph - Cytron, Ferrante, et al. - 1991
390	Literate Programming - Knuth - 1984
179	The Theory of Parsing - Aho, Ullman - 1972
141	Trans-dichotomous algorithms for minimum spanning trees and shortest paths - Fredman, Willard - 1990
137	A linear-time algorithm for a special case of disjoint set union - Gabow, Tarjan - 1985
127	T.: A fast algorithm for finding dominators in a flowgraph - Lengauer, Endre, et al. - 1979
124	Principles of Compiler Design - Aho, Ullman - 1977
110	Data structures for weighted matching and nearest common ancestors with linking - Gabow - 1990
84	A data structure for manipulating priority queues - Vuillemin - 1978
76	A class of algorithms which require nonlinear time to maintain disjoint sets - Tarjan - 1979
67	Tarjan, “Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation - Driscoll, Gabow, et al. - 1988
47	Finding dominators in directed graphs - Tarjan - 1974
38	A linear time algorithm for finding dominators in flow graphs and related problems - Harel - 1985
34	Object code optimization - Lowry, Medlock - 1969
27	Eciently computing static single assignment form and the control dependence graph - Cytron, Ferrante, et al. - 1991
26	Linear-time pointer-machine algorithms for least common ancestors, mst verification, and dominators - Buchsbaum, Kaplan, et al. - 1998
21	On finding lowest common ancestors in trees - Aho, Hopcroft, et al. - 1973
21	A linear time algorithm for placing OE-nodes - Sreedhar, Gao - 1995
18	A framework for generalized control dependence - Bilardi, Pingali
17	Immediate predominators in a directed graph [H - PURDOM, F - 1972
12	An incremental algorithm for maintaining the dominator tree of a reducible flowgraph - Ramalingam, Reps - 1994
9	A linear time algorithm for placing ;-nodes - Sreedhar, Gao - 1995
5	A fast algorithm for dominators in a - Lengauer, Tarjan - 1979
4	The art of programming, volume 1 - Knuth - 1968
3	A linear time algorithm for dominators in graphs and related problems - Harel - 1985
2	Relaxed heaps: An alternative to heaps with application to parallel computation - Driscoll, Gabow, et al. - 1988
2	Programming in modula-2(3rd corr.ed - Wirth - 1985
2	Optimal parallel veri of minimum spanning trees in logarithmic time - Dixon, Tarjan - 1997
1	Finding dominators. Fundamentals (or Foundations) of Computation Theory - Ochranova - 1983
1	Finding dominators. Fundamentals (or Foundations - Ochranova - 1983
1	Eciently computing Dominators in linear time 13 static single assignment form and the control dependence graph - Cytron, Ferrante, et al. - 1991