An associative version of the Lengauer-Tarjan algorithm for finding immediate dominators in a graph
T.V.Borets
Novosibirsk
Pages: 21–28
Abstract
An associative version of the Lengauer-Tarjan algorithm on a model of a parallel vertical data processor is presented. The algorithm is implemented as a procedure in the STAR language. The time complexity is estimated and correctness of the procedure is substantiated.
