{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:51Z","timestamp":1750219851285,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000015","name":"DOE U.S. Department of Energy","doi-asserted-by":"publisher","award":["ERKJ401"],"award-info":[{"award-number":["ERKJ401"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591315","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"427-430","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Communication Optimal Sparse LU Factorization for Planar Matrices"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9432-5855","authenticated-orcid":false,"given":"Piyush","family":"Sao","sequence":"first","affiliation":[{"name":"Oak Ridge National Laboratory, Oak Ridge, TN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0747-698X","authenticated-orcid":false,"given":"Xiaoye Sherry","family":"Li","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.598277"},{"key":"e_1_3_2_1_2_1","volume-title":"BC","author":"Sao P.","year":"2018","unstructured":"P. Sao, X. S. Li, and R. Vuduc, \"A communication-avoiding 3D LU factorization algorithm for sparse matrices,\" in Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS), (Vancouver, BC, Canada), May 2018."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/080731992"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"L. Grigori P.-Y. David J. W. Demmel and S. Peyronnet \"Brief announcement: Lower bounds on communication for sparse cholesky factorization of a model problem \" in Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures pp. 79--81 ACM 2010.","DOI":"10.1145\/1810479.1810496"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_3_2_1_7_1","first-page":"90","volume-title":"Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms,\" in Euro-Par 2011 Parallel Processing","author":"Solomonik E.","year":"2011","unstructured":"E. Solomonik and J. Demmel, \"Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms,\" in Euro-Par 2011 Parallel Processing, pp. 90--109, Springer, 2011."},{"key":"e_1_3_2_1_8_1","first-page":"127","author":"Sao P.","year":"2019","unstructured":"P. Sao, R. Kannan, X. S. Li, and R. Vuduc, \"A communication-avoiding 3d sparse triangular solver,\" in Proceedings of the ACM International Conference on Supercomputing, pp. 127--137, 2019.","journal-title":"\"A communication-avoiding 3d sparse triangular solver,\" in Proceedings of the ACM International Conference on Supercomputing"},{"key":"e_1_3_2_1_9_1","first-page":"250","volume-title":"A supernodal all-pairs shortest path algorithm,\" in Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","author":"Sao P.","year":"2020","unstructured":"P. Sao, R. Kannan, P. Gera, and R. Vuduc, \"A supernodal all-pairs shortest path algorithm,\" in Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 250--261, 2020."}],"event":{"name":"SPAA '23: 35th 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":"Orlando FL USA","acronym":"SPAA '23"},"container-title":["Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591315","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591315","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:07Z","timestamp":1750178827000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":9,"alternative-id":["10.1145\/3558481.3591315","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591315","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}