{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:01:56Z","timestamp":1780675316944,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":13,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3606043.3606053","type":"proceedings-article","created":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T17:08:44Z","timestamp":1700154524000},"page":"69-76","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Matrix Multiplication with Diagonals: Structured Sparse Matrices and Beyond"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3497-3156","authenticated-orcid":false,"given":"Sardar Anisul","family":"Haque","sequence":"first","affiliation":[{"name":"Engineering, Otterbein University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0236-9472","authenticated-orcid":false,"given":"Nazim","family":"Choudhury","sequence":"additional","affiliation":[{"name":"Computer Science, University of Wisconsin, Green Bay, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1380-6241","authenticated-orcid":false,"given":"Shahadat","family":"Hossain","sequence":"additional","affiliation":[{"name":"Mathematics and Computer Science, University of Lethbridge, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926324"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLEI.2014.6965142"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45483-1_1"},{"key":"e_1_3_2_1_4_1","volume-title":"An Efficient Parallel Divide-and-Conquer Algorithm for Generalized Matrix Multiplication. In 2023 IEEE 13th Annual Computing and Communication Workshop and Conference (CCWC). IEEE, 0442\u20130449","author":"Eagan John","year":"2023","unstructured":"John Eagan , Marc Herdman , Christian Vaughn , Nathaniel Bean , Sarah Kern , and Matin Pirouz . 2023 . An Efficient Parallel Divide-and-Conquer Algorithm for Generalized Matrix Multiplication. In 2023 IEEE 13th Annual Computing and Communication Workshop and Conference (CCWC). IEEE, 0442\u20130449 . John Eagan, Marc Herdman, Christian Vaughn, Nathaniel Bean, Sarah Kern, and Matin Pirouz. 2023. An Efficient Parallel Divide-and-Conquer Algorithm for Generalized Matrix Multiplication. In 2023 IEEE 13th Annual Computing and Communication Workshop and Conference (CCWC). IEEE, 0442\u20130449."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3571157"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2412549"},{"key":"e_1_3_2_1_7_1","unstructured":"Ga\u00ebl Guennebaud Beno\u00eet Jacob 2010. Eigen v3. http:\/\/eigen.tuxfamily.org.  Ga\u00ebl Guennebaud Beno\u00eet Jacob 2010. Eigen v3. http:\/\/eigen.tuxfamily.org."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916325"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Jeremy Kepner and John Gilbert. 2011. Graph algorithms in the language of linear algebra. SIAM.  Jeremy Kepner and John Gilbert. 2011. Graph algorithms in the language of linear algebra. SIAM.","DOI":"10.1137\/1.9780898719918"},{"key":"e_1_3_2_1_10_1","volume-title":"Mathematics of big data: Spreadsheets, databases, matrices, and graphs","author":"Kepner Jeremy","unstructured":"Jeremy Kepner and Hayden Jananthan . 2018. Mathematics of big data: Spreadsheets, databases, matrices, and graphs . MIT Press . Jeremy Kepner and Hayden Jananthan. 2018. Mathematics of big data: Spreadsheets, databases, matrices, and graphs. MIT Press."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90077-6"},{"key":"e_1_3_2_1_12_1","unstructured":"NVIDIA. 2021. Cublas. https:\/\/developer.nvidia.com\/cublas  NVIDIA. 2021. Cublas. https:\/\/developer.nvidia.com\/cublas"},{"key":"e_1_3_2_1_13_1","unstructured":"Anna Tsao and Thomas Turnbull. 1993. A comparison of algorithms for banded matrix multiplication. Citeseer.  Anna Tsao and Thomas Turnbull. 1993. A comparison of algorithms for banded matrix multiplication. Citeseer."}],"event":{"name":"HP3C 2023: 2023 7th International Conference on High Performance Compilation, Computing and Communications","location":"Jinan China","acronym":"HP3C 2023"},"container-title":["Proceedings of the 2023 7th International Conference on High Performance Compilation, Computing and Communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3606043.3606053","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3606043.3606053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:07Z","timestamp":1750178767000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3606043.3606053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":13,"alternative-id":["10.1145\/3606043.3606053","10.1145\/3606043"],"URL":"https:\/\/doi.org\/10.1145\/3606043.3606053","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-11-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}