On the Time Required for a Sequence of Matrix Products This paper discusses the multiplication of conformable sequences of row vectors, column vectors, and square matrices. The minimum time required to evaluate such products on ordinary serial computers as well as parallel computers is discussed. Algorithms are presented which properly parse such matrix sequences subject to the constraints of the machine organization. CACM January, 1973 Muraoka, Y. Kuck, D. J. matrix expressions, matrix multiplication, operation minimization, parallel machine, time minimization 4.22 5.14 CA730104 JB January 24, 1978 4:41 PM 1614 4 2557 2253 4 2557 2557 4 2557 2557 5 2557 2557 5 2557 2557 5 2557 437 5 2557 3075 5 2557 3085 5 2557 2289 6 2557 2557 6 2557 2557 6 2557 2664 6 2557 2714 6 2557