Finding dominators revisited: extended abstract

@inproceedings{Georgiadis2004FindingDR,
  title={Finding dominators revisited: extended abstract},
  author={Loukas Georgiadis and Robert E. Tarjan},
  booktitle={SODA},
  year={2004}
}
The problem of finding dominators in a flowgraph arises in many kinds of global code optimization and other settings. In 1979 Lengauer and Tarjan gave an almost-linear-time algorithm to find dominators. In 1985 Harel claimed a linear-time algorithm, but this algorithm was incomplete; Alstrup et al. [1999] gave a complete and "simpler" linear-time algorithm on a random-access machine. In 1998, Buchsbaum et al. claimed a "new, simpler" linear-time algorithm with implementations both on a random… CONTINUE READING
17 Citations
2 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…