D.S. Turaga, K. Ratakonda, et al.
SCC 2006
Four operations on normal algorithms without concluding formulas, branching, connecting, juxtaposing, and looping are introduced and corresponding theorems are proved. In this way it is shown how the main difficulties in the practical use of Markov's normal algorithms can be overcome. © 1973 BIT Foundations.
D.S. Turaga, K. Ratakonda, et al.
SCC 2006
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
L Auslander, E Feig, et al.
Advances in Applied Mathematics
Nimrod Megiddo
Journal of Symbolic Computation