Skip to search formSkip to main contentSkip to account menu

Dominator (graph theory)

Known as: Postdominance, Dominator, Lengauer-Tarjan algorithm 
In computer science, in control flow graphs, a node d dominates a node n if every path from the entry node to n must go through d. Notationally, this… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We examine diffusive shock acceleration (DSA) of the pre-existing as well as freshly injected populations of non-thermal, cosmic… 
2011
2011
Relating optimized binary code and the source-level statements from which it was created can be challenging if an optimizing… 
2010
2010
We present the results of a timing analysis of the low-frequency quasi-periodic oscillation (QPO) in the Rossi X-Ray Timing… 
2001
2001
A comprehensive model atom for non-LTE line-formation calculations for neutral and singly-ionized carbon is presented. Highly… 
2000
2000
In the food industry there is a clear trend towards the production of speciality products with a high added value. Electro… 
2000
2000
According to the current minimalist view, Bare Phrase Structure Theory (Chomsky 1994, 1995) implies the impossibility of vacuous… 
2000
2000
  • A. MurawskiC. Ong
  • 2000
  • Corpus ID: 5380755
We consider the following decision problems. PROOFNET: given a multiplicative linear logic (MLL) proof structure, is it a proof… 
1994
1994
Logic verification tools are often used to verify a gate-level implementation of a digital system in terms of its functional…