{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T20:39:02Z","timestamp":1714509542616},"reference-count":23,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["810367"],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1942892"],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"name":"US Department of Energy, Office of Science, Advanced Scientific Computing Research","award":["DE-SC-0023296"]},{"DOI":"10.13039\/100000105","name":"Office of Advanced Cyberinfrastructure","doi-asserted-by":"publisher","award":["OAC-2106920"],"id":[{"id":"10.13039\/100000105","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2024,3,31]]},"DOI":"10.1137\/22m1510443","type":"journal-article","created":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T13:21:35Z","timestamp":1707225695000},"page":"450-477","source":"Crossref","is-referenced-by-count":1,"title":["Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation"],"prefix":"10.1137","volume":"45","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-9355-4042","authenticated-orcid":true,"given":"Hussam","family":"Al Daas","sequence":"first","affiliation":[{"name":"Science and Technology Facilities Council, Rutherford Appleton Laboratory, Didcot, Oxfordshire, OX11 0QX, UK."}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1557-8027","authenticated-orcid":true,"given":"Grey","family":"Ballard","sequence":"additional","affiliation":[{"name":"Computer Science, Wake Forest University, Winston-Salem, NC 27106 USA."}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5880-1076","authenticated-orcid":true,"given":"Laura","family":"Grigori","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne PFL Institute of Mathematics, 1015 Lausanne and Paul Scherrer Institute, Laboratory for Simulation and Modelling, 5232 PSI Villigen, Switzerland; Significant part of the work performed while at Sorbonne Universit\u00e9, Inria, CNRS, Universit\u00e9 de Paris, Laboratoire Jacques-Louis Lions, Paris, France."}]},{"ORCID":"http:\/\/orcid.org\/0009-0001-1449-0165","authenticated-orcid":true,"given":"Suraj","family":"Kumar","sequence":"additional","affiliation":[{"name":"Inria Lyon Centre, France; Significant part of the work performed while at Sorbonne Universit\u00e9, Inria, CNRS, Universit\u00e9 de Paris, Laboratoire Jacques-Louis Lions, Paris, France."}]},{"ORCID":"http:\/\/orcid.org\/0009-0001-4045-0423","authenticated-orcid":true,"given":"Kathryn","family":"Rouse","sequence":"additional","affiliation":[{"name":"Inmar Intelligence, Winston-Salem, NC 27101 USA."}]}],"member":"351","published-online":{"date-parts":[[2024,2,6]]},"reference":[{"key":"ref1","first-page":"445","volume-title":"Proceedings of the 34th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201922","author":"Al Daas H.","year":"2022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.67"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492914000038"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3378445"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00065"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976137.1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4310\/MRL.2010.v17.n4.a6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(98)00011-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.86"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1206"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00045"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.80"},{"key":"ref15","first-page":"326","volume-title":"Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, STOC \u201981","author":"Hong J.-W.","year":"1981"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1949-09320-5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2431"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/19M1261043"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/20M1338599"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/19M1257718"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1177\/1094342005051521"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T23:04:51Z","timestamp":1711753491000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/22M1510443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,6]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,31]]}},"alternative-id":["10.1137\/22M1510443"],"URL":"https:\/\/doi.org\/10.1137\/22m1510443","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,6]]}}}