144

A fast algorithm for finding dominators in a flowgraph
– Thomas Lengauer, Robert Endre, Tar Jan
 1979

14

A New, Simpler LinearTime Dominators Algorithm
– Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook
 1998

839

Efficiently computing static single assignment form and the control dependence graph
– Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck
 1991

137

Data structures for weighted matchings and nearest ancestors with linking
– H N Gabow
 1990

86

Applications of path compressions on balanced trees
– R E Tarjan
 1979

80

Testing flow graph reducibility
– R TARJAN
 1972

37

Object code optimization
– E S Lorry, V W Medlock
 1969

39

A linear time algorithm for finding dominators in flow graphs and related problems
– D Harel
 1985

825

The program dependence graph and its use in optimization
– Jeanne Ferrante, Karl J. Ottenstein, Joe D. Warren
 1987

126

Global data flow analysis and iterative algorithms
– John B. Kam, Jeffrey, D. Ullman
 1976

335

Fast algorithms for finding nearest common ancestor
– D Harel, R E Tarjan
 1984

11

Graph theoretic constructs for program control flow analysis
– F E Allen, J Cocke
 1972

151

lineartime algorithm for a special case of disjoint set union
– H N Gabow, A R E Tarjan
 1983

18

Immediate predominators in a directed graph [h
– J Paul W Purdom, E F Moore
 1972

50

Finding dominators in directed graphs
– R TARJAN
 1972

16

Applications of boolean matrices to the analysis of flow diagrams
– R T Prosser
 1959

85

Control flow analysis
– Frances E Allen
 1970

27

LinearTime PointerMachine Algorithms for Least Common Ancestors, MST Verification, and Dominators
– Adam L. Buchsbaum , Haim Kaplan, Anne Rogers, Jeffery R. Westbrook
 1998

996

Depth first search and linear graph algorithms
– Robert Tarjan
 1972
