{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:42:10Z","timestamp":1780994530140,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T00:00:00Z","timestamp":1340582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,25]]},"DOI":"10.1145\/2312005.2312044","type":"proceedings-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:31:21Z","timestamp":1340803881000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":86,"title":["Communication-optimal parallel algorithm for strassen's matrix multiplication"],"prefix":"10.1145","author":[{"given":"Grey","family":"Ballard","sequence":"first","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olga","family":"Holtz","sequence":"additional","affiliation":[{"name":"UC Berkeley and TU Berlin, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Lipshitz","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oded","family":"Schwartz","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.395.0575"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90188-N"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312021"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989495"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/090769156"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(89)90091-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02575865"},{"key":"e_1_3_2_1_8_1","volume-title":"SIAM","author":"Blackford L. S.","year":"1997"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00176-X"},{"key":"e_1_3_2_1_10_1","volume-title":"Montana State University","author":"Cannon L.","year":"1969"},{"key":"e_1_3_2_1_11_1","first-page":"8","article-title":"A new parallel matrix multiplication algorithm on distributed-memory concurrent computers. Concurrency","volume":"10","author":"Choi J","year":"1998","journal-title":"Practice and Experience"},{"key":"e_1_3_2_1_12_1","first-page":"7","article-title":"PUMMA: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers. Concurrency","volume":"6","author":"Choi J.","year":"1994","journal-title":"Practice and Experience"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.39"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211038"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28396"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0114-x"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0061-6"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.v16:8"},{"key":"e_1_3_2_1_19_1","unstructured":"Fuller S. H. and Millett L. I. Eds. The Future of Computing Performance: Game Over or Next Level? The National Academies Press Washington D.C. 2011. 200 pages http:\/\/www.nap.edu.   Fuller S. H. and Millett L. I. Eds. The Future of Computing Performance: Game Over or Next Level? The National Academies Press Washington D.C. 2011. 200 pages http:\/\/www.nap.edu."},{"key":"e_1_3_2_1_20_1","unstructured":"Graham S. L. Snir M. and Patterson C. A. Eds. Getting up to Speed: The Future of Supercomputing. Report of National Research Council of the National Academies Sciences. The National Academies Press Washington D.C. 2004. 289 pages http:\/\/www.nap.edu.  Graham S. L. Snir M. and Patterson C. A. Eds. Getting up to Speed: The Future of Supercomputing. Report of National Research Council of the National Academies Sciences. The National Academies Press Washington D.C. 2004. 289 pages http:\/\/www.nap.edu."},{"key":"e_1_3_2_1_21_1","first-page":"3","volume-title":"Parallel Processing Letters","volume":"6","author":"Grayson B.","year":"1995"},{"key":"e_1_3_2_1_22_1","volume-title":"SIAM","author":"Higham N. J.","year":"2002"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.03.003"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1993.262814"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/315891.315965"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209027"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205016"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211020"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210032"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033408.2033420"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of Parallel and Distributed Computing and Systems (PDCS) (Nov.","author":"Song F.","year":"2006"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Strassen V. Relative bilinear complexity and matrix multiplication. Journal fur die reine und angewandte Mathematik (Crelles Journal) 1987 375--376 (1987) 406--443.  Strassen V. Relative bilinear complexity and matrix multiplication. Journal fur die reine und angewandte Mathematik (Crelles Journal) 1987 375--376 (1987) 406--443.","DOI":"10.1515\/crll.1987.375-376.406"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"van de Geijn R. A. and Watts J. SUMMA: scalable universal matrix multiplication algorithm. Concurrency - Practice and Experience 9 4 (1997) 255--274.  van de Geijn R. A. and Watts J. SUMMA: scalable universal matrix multiplication algorithm. Concurrency - Practice and Experience 9 4 (1997) 255--274.","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2"},{"key":"e_1_3_2_1_37_1","unstructured":"Williams V. V. Breaking the Coppersmith-Winograd barrier 2012. Manuscript.  Williams V. V. Breaking the Coppersmith-Winograd barrier 2012. Manuscript."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(71)90009-7"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCS.1988.12538"}],"event":{"name":"SPAA '12: 24th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Pittsburgh Pennsylvania USA","acronym":"SPAA '12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312044","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2312005.2312044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:48Z","timestamp":1750236528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":39,"alternative-id":["10.1145\/2312005.2312044","10.1145\/2312005"],"URL":"https:\/\/doi.org\/10.1145\/2312005.2312044","relation":{},"subject":[],"published":{"date-parts":[[2012,6,25]]},"assertion":[{"value":"2012-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}