Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
On loops, dominators, and dominance frontier
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
On loops, dominators, and dominance frontiers
ACM Transactions on Programming Languages and Systems (TOPLAS)
On AC0 implementations of fusion trees and atomic heaps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Range Searching Over Tree Cross Products
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
General framework for removal of clock network pessimism
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Dominator Trees and Fast Verification of Proof Nets
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Journal of Functional Programming
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Structural Testing Based on Minimum Kernels
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Dominance analysis of irreducible CFGs by reduction
ACM SIGPLAN Notices
Corrigendum: a new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dominator tree verification and vertex-disjoint paths
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A fast algorithm for finding common multiple-vertex dominators in circuit graphs
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Two flow network simplification algorithms
Information Processing Letters
Fast verification of MLL proof nets via IMLL
ACM Transactions on Computational Logic (TOCL)
Average case analysis of DJ graphs
Journal of Discrete Algorithms
A practical interprocedural dominance algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing SSA Form with Matrices
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimal Lambda Lifting in Quadratic Time
Implementation and Application of Functional Languages
Two flow network simplification algorithms
Information Processing Letters
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
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
A simpler and more efficient algorithm for the next-to-shortest path problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
ESA'11 Proceedings of the 19th European conference on Algorithms
Revisiting the tree Constraint
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Efficient algorithms for simplifying flow networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
RealTime-BestPoint-Based compiler optimization algorithm
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Debugging with dominance: on-the-fly RTL debug solution implications
Proceedings of the International Conference on Computer-Aided Design
Efficient computation of causal behavioural profiles using structural decomposition
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Dominators, directed bipolar orders, and independent spanning trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Causal Behavioural Profiles - Efficient Computation, Applications, and Evaluation
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Computing strong articulation points and strong bridges in large scale graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Calculating graph algorithms for dominance and shortest path
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
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
Finding dominators via disjoint set union
Journal of Discrete Algorithms
| Hi-index | 0.01 |
A linear-time algorithm is presented for finding dominators in control flow graphs.