{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:15:02Z","timestamp":1765887302759,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"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":[[2011,6,4]]},"DOI":"10.1145\/1989493.1989495","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Graph expansion and communication costs of fast matrix multiplication"],"prefix":"10.1145","author":[{"given":"Grey","family":"Ballard","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Holtz","sequence":"additional","affiliation":[{"name":"University of California, Berkeley and TU-Berlin., Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Schwartz","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, University of California, Berk, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646665.699419"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548307008851"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0909040"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248391"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347137"},{"volume-title":"Springer Verlag","year":"1997","author":"Burgisser P.","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989531"},{"volume-title":"Unpublished","year":"2011","author":"Ballard G.","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/090760969"},{"key":"e_1_3_2_1_11_1","unstructured":"G. Ballard J. Demmel O. Holtz and O. Schwartz. Minimizing communication in linear algebra. Submitted. Available from http:\/\/arxiv.org\/abs\/0905.2485 2010.  G. Ballard J. Demmel O. Holtz and O. Schwartz. Minimizing communication in linear algebra. Submitted. Available from http:\/\/arxiv.org\/abs\/0905.2485 2010."},{"volume-title":"Unpublished","year":"2011","author":"Ballard G.","key":"e_1_3_2_1_12_1"},{"volume-title":"Unpublished","year":"2011","author":"Ballard G.","key":"e_1_3_2_1_13_1"},{"volume-title":"Unpublished","year":"2011","author":"Ballard G.","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02575865"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000131"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647681.732330"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Y. D.\n       \n      Burago\n     and \n      \n      \n      V. A.\n       \n      Zalgaller\n      \n  \n  . \n  Geometric Inequalities volume \n  285\n   of \n  Grundlehren der Mathematische Wissenschaften\n  . \n  Springer Berlin 1988\n  .  Y. D. Burago and V. A. Zalgaller. Geometric Inequalities volume 285 of Grundlehren der Mathematische Wissenschaften. Springer Berlin 1988.","DOI":"10.1007\/978-3-662-07441-1"},{"volume-title":"Montana State University","year":"1969","author":"Cannon L.","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.39"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0438"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109622"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211038"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28396"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1994.1001"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.v16:8"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796479"},{"key":"e_1_3_2_1_29_1","unstructured":"S. L. Graham M. Snir and C. A. Patterson editors. 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.  S. L. Graham M. Snir and C. A. Patterson editors. 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_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369096"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_33_1","unstructured":"M. Koucky V. Kabanets and A. Kolokolova. Expanders made elementary 2010. In preparation Available from http:\/\/www.cs.sfu.ca\/~kabanets\/papers\/expanders.pdf.  M. Koucky V. Kabanets and A. Kolokolova. Expanders made elementary 2010. In preparation Available from http:\/\/www.cs.sfu.ca\/~kabanets\/papers\/expanders.pdf."},{"volume-title":"Schwartz","year":"2008","author":"Leiserson C. E.","key":"e_1_3_2_1_34_1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90105-6"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1949-09320-5"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63529"},{"volume-title":"Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2002","year":"2002","author":"Michael J. P.","key":"e_1_3_2_1_38_1"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209027"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402147"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211020"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.2307\/3062153"},{"volume-title":"Brown University","year":"1994","author":"Savage J.","key":"e_1_3_2_1_43_1"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210032"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"V. Strassen. Relative bilinear complexity and matrix multiplication. Journal fur die reine und angewandte Mathematik (Crelles Journal) 1987(375-376):406--443 1987.  V. Strassen. Relative bilinear complexity and matrix multiplication. Journal fur die reine und angewandte Mathematik (Crelles Journal) 1987(375-376):406--443 1987.","DOI":"10.1515\/crll.1987.375-376.406"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896297744"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/1413370.1413402"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(71)90009-7"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCS.1988.12538"}],"event":{"name":"SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"San Jose California USA","acronym":"SPAA '11"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989495","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989493.1989495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:56Z","timestamp":1750244396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989495"}},"subtitle":["regular submission"],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":50,"alternative-id":["10.1145\/1989493.1989495","10.1145\/1989493"],"URL":"https:\/\/doi.org\/10.1145\/1989493.1989495","relation":{},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}