{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:18:41Z","timestamp":1765887521606,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T00:00:00Z","timestamp":1374537600000},"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":[[2013,7,23]]},"DOI":"10.1145\/2486159.2486196","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"222-231","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["Communication optimal parallel multiplication of sparse random matrices"],"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":"Aydin","family":"Buluc","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Ber, 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":"Laura","family":"Grigori","sequence":"additional","affiliation":[{"name":"INRIA Paris - Rocquencourt, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Lipshitz","sequence":"additional","affiliation":[{"name":"University of California Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Schwartz","sequence":"additional","affiliation":[{"name":"University of California Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivan","family":"Toledo","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"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.1145\/2312005.2312021"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312044"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/090769156"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/347185"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/181014.181756"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.45"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_9_1","series-title":"SIAM Journal of Scientific Computing (SISC), 34(4):170--191","volume-title":"Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments","author":"Bulu\u00e7 A.","year":"2012","unstructured":"A. Bulu\u00e7 and J. Gilbert . Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments . SIAM Journal of Scientific Computing (SISC), 34(4):170--191 , 2012 . A. Bulu\u00e7 and J. Gilbert. Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments. SIAM Journal of Scientific Computing (SISC), 34(4):170--191, 2012."},{"key":"e_1_3_2_1_10_1","volume-title":"On parallelizing matrix multiplication by the column-row method. arXiv preprint arXiv:1210.0461","author":"Campagna A.","year":"2012","unstructured":"A. Campagna , K. Kutzkov , and R. Pagh . On parallelizing matrix multiplication by the column-row method. arXiv preprint arXiv:1210.0461 , 2012 . A. Campagna, K. Kutzkov, and R. Pagh. On parallelizing matrix multiplication by the column-row method. arXiv preprint arXiv:1210.0461, 2012."},{"key":"e_1_3_2_1_12_1","volume-title":"A general parallel sparse-blocked matrix multiply for linear scaling SCF theory. Computer physics communications, 128(1-2):93--107","author":"Challacombe M.","year":"2000","unstructured":"M. Challacombe . A general parallel sparse-blocked matrix multiply for linear scaling SCF theory. Computer physics communications, 128(1-2):93--107 , 2000 . M. Challacombe. A general parallel sparse-blocked matrix multiply for linear scaling SCF theory. Computer physics communications, 128(1-2):93--107, 2000."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.80"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u0151os Paul","year":"1959","unstructured":"Paul Erd\u0151os and Alfr\u00e9d R\u00e9nyi . On random graphs . Publicationes Mathematicae Debrecen , 6 : 290 -- 297 , 1959 . Paul Erd\u0151os and Alfr\u00e9d R\u00e9nyi. On random graphs. Publicationes Mathematicae Debrecen, 6:290--297, 1959.","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2008.45"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810496"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/876880.879566"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/355791.355796"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90058-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1949-09320-5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008264"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.008"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2304576.2304607"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063487"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033408.2033420"},{"key":"e_1_3_2_1_28_1","volume-title":"SUMMA: Scalable universal matrix multiplication algorithm. Concurrency - Practice and Experience, 9(4):255--274","author":"van de Geijn R.","year":"1997","unstructured":"R. van de Geijn and J. Watts . SUMMA: Scalable universal matrix multiplication algorithm. Concurrency - Practice and Experience, 9(4):255--274 , 1997 . R. van de Geijn and J. Watts. SUMMA: Scalable universal matrix multiplication algorithm. Concurrency - Practice and Experience, 9(4):255--274, 1997."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/040608635"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1021\/ct200897x"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077466"}],"event":{"name":"SPAA '13: 25th 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"],"location":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"SPAA '13"},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486196","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486159.2486196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:53Z","timestamp":1750231733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,23]]},"references-count":29,"alternative-id":["10.1145\/2486159.2486196","10.1145\/2486159"],"URL":"https:\/\/doi.org\/10.1145\/2486159.2486196","relation":{},"subject":[],"published":{"date-parts":[[2013,7,23]]},"assertion":[{"value":"2013-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}