{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:31:58Z","timestamp":1768030318623,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Office of Science of the DOE","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,2]]},"DOI":"10.1145\/3503221.3508430","type":"proceedings-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T13:58:22Z","timestamp":1648475902000},"page":"453-454","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel algorithms for masked sparse matrix-matrix products"],"prefix":"10.1145","author":[{"given":"Sr\u0111an","family":"Milakovi\u0107","sequence":"first","affiliation":[{"name":"Rice University"}]},{"given":"Oguz","family":"Selvitopi","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley Nat. Laboratory"}]},{"given":"Israt","family":"Nisa","sequence":"additional","affiliation":[{"name":"AWS AI"}]},{"given":"Zoran","family":"Budimli\u0107","sequence":"additional","affiliation":[{"name":"Rice University"}]},{"given":"Aydin","family":"Bulu\u00e7","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley Nat. Laboratory"}]}],"member":"320","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536313"},{"key":"e_1_3_2_1_2_1","unstructured":"Timothy A Davis. Algorithm 10xx: Suitesparse:graphblas: parallel graph algorithms in the language of sparse linear algebra. draft manuscript."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2018.06.009"},{"key":"e_1_3_2_1_4_1","volume-title":"Parallel algorithms for masked sparse matrix-matrix products. CoRR, abs\/2111.09947","author":"Milakovic Srdan","year":"2021","unstructured":"Srdan Milakovic, Oguz Selvitopi, Israt Nisa, Zoran Budimlic, and Aydin Bulu\u00e7. Parallel algorithms for masked sparse matrix-matrix products. CoRR, abs\/2111.09947, 2021."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.102545"}],"event":{"name":"PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Seoul Republic of Korea","acronym":"PPoPP '22","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503221.3508430","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3503221.3508430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:39Z","timestamp":1750191099000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503221.3508430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":5,"alternative-id":["10.1145\/3503221.3508430","10.1145\/3503221"],"URL":"https:\/\/doi.org\/10.1145\/3503221.3508430","relation":{},"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"2022-03-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}