Corrigendum: a new, simpler linear-time dominators algorithm

Authors:
Adam L. Buchsbaum;Haim Kaplan;Anne Rogers;Jeffery R. Westbrook
Affiliations:
AT&T Labs,Florham Park, NJ;Tel Aviv University, Tel Aviv, Israel;University of Chicago, Chicago, IL;San Diego, CA
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
2005

A new, simpler linear-time dominators algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Applications of Path Compression on Balanced Trees

Journal of the ACM (JACM)
Dominators in Linear Time

SIAM Journal on Computing
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Finding dominators revisited: extended abstract

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Linear time algorithms for two disjoint paths problems on directed acyclic graphs

Theoretical Computer Science
An experimental study of dynamic dominators

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Hi-index	0.00

Corrigendum to ACM Transactions on Programming Languages and Systems, 20(6):1265--1296, 1998.