On the distribution of the number of computations in any finite number of subtrees for the stack algorithm
Rolf Johannesson, Kamil Sh. Zigangirov · Lund University Publications (Lund University) · 1983
Multitype branching processes have been employed to determine the stack algorithm computational distribution for one subtree. These results are extended here to the distribution of the number of computations in any finite number of subtrees. Starting from the computational distribution forK-1subsequent subtrees, a recurrent equation for the distribution forKsubsequent subtrees is determined.