Finding dominators in practice

DOI10.1007/978-3-540-30140-0_60MaRDI QIDQ5464626zbMATH OpenOpenAlexFDO

Authors Loukas Georgiadis, Renato F. Werneck, Spyridon Triantafyllis, David I. August, Robert E. Tarjan

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Theory of software (68N99) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Finding Dominators in Practice
• Finding dominators revisited (extended abstract)
• Finding dominators via disjoint set union
• An experimental study of dynamic dominators
• Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems

Cited in

(18)

• An approach for extracting a small unsatisfiable core
• Computing dominators in parallel
• On the degree of dominator trees
• Generalized dominators for structured programs
• An experimental study of dynamic dominators
• Dominator tree verification and vertex-disjoint paths
• Validating dominator trees for a fast, verified dominance test
• scientific article; zbMATH DE number 3870590 (Why is no real title available?)
• Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
• Computing Frequency Dominators and Related Problems
• Finding dominators via disjoint set union
• Mechanized verification of computing dominators for formalizing compilers
• Generalized dominators for structured programs
• Finding Dominators in Practice
• Finding dominators revisited (extended abstract)
• Generalized dominators
• Computing dominators on a cube-connected machine
• Average case analysis of DJ graphs

This page was built for publication: Finding dominators in practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464626)