{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:43:52Z","timestamp":1752983032659,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1942892, OAC-2106920"],"award-info":[{"award-number":["CCF-1942892, OAC-2106920"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["810367"],"award-info":[{"award-number":["810367"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538552","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"445-448","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Hussam","family":"Al Daas","sequence":"first","affiliation":[{"name":"Rutherford Appleton Laboratory, Didcot, Oxfordshire, United Kingdom"}]},{"given":"Grey","family":"Ballard","sequence":"additional","affiliation":[{"name":"Wake Forest University, Winston-Salem, NC, USA"}]},{"given":"Laura","family":"Grigori","sequence":"additional","affiliation":[{"name":"Inria, Paris, France"}]},{"given":"Suraj","family":"Kumar","sequence":"additional","affiliation":[{"name":"Inria, Paris, France"}]},{"given":"Kathryn","family":"Rouse","sequence":"additional","affiliation":[{"name":"Inmar Intelligence, Winston-Salem, NC, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90188-N"},{"key":"#cr-split#-e_1_3_2_1_2_1.1","unstructured":"H. Al Daas G. Ballard L. Grigori S. Kumar and K. Rouse. 2022. Tight Memory- Independent Parallel Matrix Multiplication Communication Lower Bounds. Technical Report. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2205.13407 10.48550\/arXiv.2205.13407"},{"key":"#cr-split#-e_1_3_2_1_2_1.2","unstructured":"H. Al Daas G. Ballard L. Grigori S. Kumar and K. Rouse. 2022. Tight Memory- Independent Parallel Matrix Multiplication Communication Lower Bounds. Technical Report. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2205.13407"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395121"},{"key":"#cr-split#-e_1_3_2_1_4_1.1","doi-asserted-by":"crossref","unstructured":"G. Ballard and K. Rouse. 2020. General Memory-Independent Lower Bound for MTTKRP. In SIAM PP. 1--11. https:\/\/doi.org\/10.1137\/1.9781611976137.1 10.1137\/1.9781611976137.1","DOI":"10.1137\/1.9781611976137.1"},{"key":"#cr-split#-e_1_3_2_1_4_1.2","doi-asserted-by":"crossref","unstructured":"G. Ballard and K. Rouse. 2020. General Memory-Independent Lower Bound for MTTKRP. In SIAM PP. 1--11. https:\/\/doi.org\/10.1137\/1.9781611976137.1","DOI":"10.1137\/1.9781611976137.1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"S. Boyd and L. Vandenberghe. 2004. Convex Optimization. Cambridge University Press. https:\/\/web.stanford.edu\/~boyd\/cvxbook\/  S. Boyd and L. Vandenberghe. 2004. Convex Optimization. Cambridge University Press. https:\/\/web.stanford.edu\/~boyd\/cvxbook\/","DOI":"10.1017\/CBO9780511804441"},{"key":"#cr-split#-e_1_3_2_1_6_1.1","doi-asserted-by":"crossref","unstructured":"J. Demmel D. Eliahu A. Fox S. Kamil B. Lipshitz O. Schwartz and O. Spillinger. 2013. Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. In IPDPS. 261--272. https:\/\/doi.org\/10.1109\/IPDPS.2013.80 10.1109\/IPDPS.2013.80","DOI":"10.1109\/IPDPS.2013.80"},{"key":"#cr-split#-e_1_3_2_1_6_1.2","doi-asserted-by":"crossref","unstructured":"J. Demmel D. Eliahu A. Fox S. Kamil B. Lipshitz O. Schwartz and O. Spillinger. 2013. Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. In IPDPS. 261--272. https:\/\/doi.org\/10.1109\/IPDPS.2013.80","DOI":"10.1109\/IPDPS.2013.80"},{"key":"#cr-split#-e_1_3_2_1_7_1.1","doi-asserted-by":"crossref","unstructured":"J. W. Hong and H. T. Kung. 1981. I\/O complexity: The red-blue pebble game. In STOC. ACM 326--333. https:\/\/doi.org\/10.1145\/800076.802486 10.1145\/800076.802486","DOI":"10.1145\/800076.802486"},{"key":"#cr-split#-e_1_3_2_1_7_1.2","doi-asserted-by":"crossref","unstructured":"J. W. Hong and H. T. Kung. 1981. I\/O complexity: The red-blue pebble game. In STOC. ACM 326--333. https:\/\/doi.org\/10.1145\/800076.802486","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1949-09320-5"},{"key":"#cr-split#-e_1_3_2_1_10_1.1","unstructured":"T. M. Smith B. Lowery J. Langou and R. A. van de Geijn. 2019. A Tight I\/O Lower Bound for Matrix Multiplication. Technical Report. arXiv. https:\/\/doi.org\/ 10.48550\/arXiv.1702.02017 10.48550\/arXiv.1702.02017"},{"key":"#cr-split#-e_1_3_2_1_10_1.2","doi-asserted-by":"crossref","unstructured":"T. M. Smith B. Lowery J. Langou and R. A. van de Geijn. 2019. A Tight I\/O Lower Bound for Matrix Multiplication. Technical Report. arXiv. https:\/\/doi.org\/ 10.48550\/arXiv.1702.02017","DOI":"10.1145\/3362694"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342005051521"}],"event":{"name":"SPAA '22: 34th 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":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538552","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538552","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538552"}},"subtitle":["Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds"],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":16,"alternative-id":["10.1145\/3490148.3538552","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538552","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}