{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:15:35Z","timestamp":1787386535128,"version":"build-2736575974"},"reference-count":33,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1981,11]]},"abstract":"<jats:p>Matrix multiplication algorithms for cube connected and perfect shuffle computers are presented. It is shown that in both these models two $n \\times n$ matrices can be multiplied in $O(n\/m + \\log m)$ time when $n^2 m$, $1 \\leqq m \\leqq n$, processing elements (PEs) are available. When only $m^2 $, $1 \\leqq m \\leqq n$, PEs are available, two $n \\times n$ matrices can be multiplied in $O(n^2\/m + m(n\/m)^{2.61} )$ time. It is shown that many graph problems can be solved efficiently using the matrix multiplication algorithms.<\/jats:p>","DOI":"10.1137\/0210049","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:24:20Z","timestamp":1109226260000},"page":"657-675","source":"Crossref","is-referenced-by-count":257,"title":["Parallel Matrix and Graph Algorithms"],"prefix":"10.1137","volume":"10","author":[{"given":"Eliezer","family":"Dekel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Nassimi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sartaj","family":"Sahni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.22"},{"key":"R2","unstructured":"T. Agerwala, B. Lint,  Communication in parallel algorithms for Boolean matrix multiplication,  Proc. 1978 IEEE Int. Conference on Parallel Processing,  1978,  146\u2013153"},{"key":"R3","unstructured":"E. Arjomandi, Ph.D. Thesis,  A study of parallelism in graph theory, Dept. of Computer Science, University of Toronto,  1975, December"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"R5","unstructured":"L. E. Cannon, Ph.D. Thesis,  A cellular computer to implement the Kalman filter algorithm, Montana State University,  1969"},{"key":"R6","unstructured":"A. Chandra,  Maximal parallelism in matrix multiplication, Tech. Rept., R C 6193, IBM,  1976, Sept."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"I-Ngo Chen,  A new parallel algorithm for network flow problems,  Proc. 1974 Sagamore Computer Conference,  1974,  306\u2013307","DOI":"10.1007\/3-540-07135-0_131"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.14"},{"key":"R9","unstructured":"D. Eckstein, Ph.D. Thesis,  Parallel graph processing using depth-first search and breadth-first search, University of Iowa,  1977"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1966.5273"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1108\/eb005421"},{"key":"R12","volume-title":"Communication, transmission, and transportation networks","author":"Frank Howard","year":"1971"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322057"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"D. S. Hirschberg,  Parallel algorithms for the transitive closure and the connected component problems,  Eighth Annual ACM Symposium on Theory of Computing (Hershey, Pa., 1976), Assoc. Comput. Mach., New York,  1976,  55\u201357 55:116870369.68022","DOI":"10.1145\/800113.803631"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359582"},{"key":"R16","volume-title":"Fundamentals of data structures","author":"Horowitz Ellis","year":"1976"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/0207033"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674637"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.5009205"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321882"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80043-1"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675216"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1145\/322169.322172"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675791"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322329"},{"key":"R26","unstructured":"V. YA. Pan,  New methods for the acceleration of matrix multiplications,  Proc. 20th IEEE Symposium on Foundations of Computer Science,  1979,  28\u201338"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675167"},{"key":"R28","unstructured":"C. Savage, Ph.D. Thesis,  Parallel algorithms for graph theoretic problems, University of Illinois, Urbana,  1978, August"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675280"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223205"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675014"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1145\/359461.359481"},{"key":"R33","unstructured":"F. van Scoy, Masters Thesis,  Parallel algorithms in cellular spaces, Ph.D. dissertation, University of Virginia,  1976"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0210049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:41:28Z","timestamp":1787337688000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0210049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["10.1137\/0210049"],"URL":"https:\/\/doi.org\/10.1137\/0210049","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}