1. The Design and Analysis of Computer Algorithms;Aho,1974
2. Boolean matrix multiplication and transitive closure;Fisher;Proc. 12th Annual Symposium on Switching and Automata Theory,1971
3. Field extension and trilinear aggregating, uniting and canceling for the acceleration of matrix multiplication;Pan;Proc. 20th Annual Symposium on Foundation of Computer Science,1979
4. F. Romani, Complexity measures for matrix multiplication algorithms, Calcolo, to appear.
5. Partial and total matrix multiplication;Schönhage,1980