{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:21:25Z","timestamp":1777965685963,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006374","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["810367"],"award-info":[{"award-number":["810367"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","award":["0023296"],"award-info":[{"award-number":["0023296"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Office of Advanced Cyberinfrastructure","doi-asserted-by":"publisher","award":["2106920"],"award-info":[{"award-number":["2106920"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1942892"],"award-info":[{"award-number":["1942892"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743332","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"633-637","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement: Minimizing Communication for Parallel Symmetric Tensor Times Same Vector Computation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9355-4042","authenticated-orcid":false,"given":"Hussam","family":"Al Daas","sequence":"first","affiliation":[{"name":"Rutherford Appleton Laboratory, Didcot, Oxfordshire, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1557-8027","authenticated-orcid":false,"given":"Grey","family":"Ballard","sequence":"additional","affiliation":[{"name":"Wake Forest University, Winston-Salem, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5880-1076","authenticated-orcid":false,"given":"Laura","family":"Grigori","sequence":"additional","affiliation":[{"name":"EPFL and PSI, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1449-0165","authenticated-orcid":false,"given":"Suraj","family":"Kumar","sequence":"additional","affiliation":[{"name":"Inria Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4045-0423","authenticated-orcid":false,"given":"Kathryn","family":"Rouse","sequence":"additional","affiliation":[{"name":"Inmar Intelligence, Winston-Salem, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0581-2772","authenticated-orcid":false,"given":"Mathieu","family":"V\u00e9rit\u00e9","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS54959.2023.00044"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591072"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3727344"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"H. Al Daas G. Ballard L. Grigori S. Kumar K. Rouse and M. V\u00e9rit\u00e9. 2025. Minimizing Communication for Parallel Symmetric Tensor Times Same Vector Computation. https:\/\/arxiv.org\/abs\/2506.15488","DOI":"10.1145\/3694906.3743332"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00065"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538587"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1206"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"C. J. Colbourn and J. H. Dinitz. 1996. Handbook of Combinatorial Designs.","DOI":"10.1201\/9781420049954"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"L. R. Ford and D. R. Fulkerson. 1987. Maximal Flow Through a Network. Birkh\u00e4user Boston Boston MA 243--248. https:\/\/doi.org\/10.1007\/978-0-8176-4842-8_15","DOI":"10.1007\/978-0-8176-4842-8_15"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/bull\/1553"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"J. E. Hopcroft and R. M. Karp. 1973. An n5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on computing 2 4 (1973) 225--231. https:\/\/doi.org\/10.1137\/0202019","DOI":"10.1137\/0202019"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0895-0"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CAMAP.2005.1574201"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"L. H. Loomis and H. Whitney. 1949. An Inequality Related to the Isoperimetric Inequality. Bull. Amer. Math. Soc. 55 10 (1949). https:\/\/doi.org\/10.1090\/S0002-9904-1949-09320-5","DOI":"10.1090\/S0002-9904-1949-09320-5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.05.007"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC58850.2023.00049"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342005051521"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","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"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:18:43Z","timestamp":1777922323000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":18,"alternative-id":["10.1145\/3694906.3743332","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743332","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}