S. Alstrup, P. W. Lauridsen, and M. Thorup. Dominators in linear time. DIKU technical report, (35), 1996. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
A Simple, Fast Dominance Algorithm - Cooper, Harvey, Kennedy (2001) (1 citation) (Correct)
General-Purpose Architecture Instruction Scheduling Techniques - De Sutter (1998) (Correct)
A New Algorithm for Slicing Unstructured Programs - Harman, Danicic (1998) (4 citations) (Correct)
Common-subexpression Elimination of Conditional Expressions - de Moor, Secher (2001) (Correct)
On Loops, Dominators, and Dominance Frontiers - Ramalingam (Correct)
On Loops, Dominators, and Dominance Frontiers - Ramalingam (1999) (Correct)
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000) (Correct)
Range Searching Over Tree Cross Products - Buchsbaum, Goodrich, Westbrook (2000) (10 citations) (Correct)
Compiling Embedded Languages - Elliott, Finne, de Moor (2000) (25 citations) (Correct)
Dominator Trees and Fast Verification of Proof Nets - Murawski, Ong (2000) (1 citation) (Correct)
On Loops, Dominators, and Dominance Frontiers - Ramalingam (1999) (Correct)
Linear-Time Pointer-Machine Algorithms for Least.. - Buchsbaum.. (1998) (14 citations) (Correct)
A New, Simpler Linear-Time Dominators Algorithm - Buchsbaum, Kaplan, Rogers.. (1999) (1 citation) (Correct)
A Practical Mobile-Code Format with Linear Verification Effort - Wang, Franz (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC