P.Blaznik.<br>
Matrix triangularization on a MIMD computer.<br>
<i>Proc. 9th IASTED Int'l Symp. Applied Informatics</i>, pp.48-50, Innsbruck,
Austria, February 18-21, 1991.<p>

Gaussian eliminations and Givens transformations were used as an example of 
matrix triangularisation in the paper. For a sequential version of every 
algorithm was constructed an associated task graph. Parallel algorithms
with quadratic time complexity were designed by assigning tasks to processors 
according to the precedence constraints.