{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:00Z","timestamp":1750220940443,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ACI 1550486"],"award-info":[{"award-number":["ACI 1550486"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-16-2-003"],"award-info":[{"award-number":["FA8750-16-2-003"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,8]]},"DOI":"10.1145\/3315454.3329962","type":"proceedings-article","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:02:18Z","timestamp":1559941338000},"page":"93-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Linear algebraic depth-first search"],"prefix":"10.1145","author":[{"given":"Daniele G.","family":"Spampinato","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}]},{"given":"Upasana","family":"Sridhar","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}]},{"given":"Tze Meng","family":"Low","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms , Third Edition (3 rd ed.). The MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press.","edition":"3"},{"key":"e_1_3_2_2_2_1","unstructured":"Timothy Davis. 2018. Algorithm 9xx: SuiteSparse: GraphBLAS: graph algorithms in the language of sparse linear algebra. (2018).  Timothy Davis. 2018. Algorithm 9xx: SuiteSparse: GraphBLAS: graph algorithms in the language of sparse linear algebra. (2018)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Jeremy Kepner Peter Aaltonen David Bader Ayd\u0131n Bulu\u00e7 Franz Franchetti John Gilbert Dylan Hutchison Manoj Kumar Andrew Lumsdaine Henning Meyerhenke etal 2016. Mathematical foundations of the GraphBLAS. arXiv preprint arXiv:1606.05790 (2016).  Jeremy Kepner Peter Aaltonen David Bader Ayd\u0131n Bulu\u00e7 Franz Franchetti John Gilbert Dylan Hutchison Manoj Kumar Andrew Lumsdaine Henning Meyerhenke et al. 2016. Mathematical foundations of the GraphBLAS. arXiv preprint arXiv:1606.05790 (2016).","DOI":"10.1109\/HPEC.2016.7761646"},{"key":"e_1_3_2_2_6_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_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199530"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091046"},{"key":"e_1_3_2_2_9_1","volume-title":"Franz Franchetti, and Scott McMillan.","author":"Low Tze Meng","year":"2018","unstructured":"Tze Meng Low , Daniele G. Spampinato , Anurag Kutuluru , Upasana Sridhar , Doru Thom Popovici , Franz Franchetti, and Scott McMillan. 2018 . Linear Algebraic Formulation of Edge-centric K-truss Algorithms with Adjacency Matrices . 1\u20137. Tze Meng Low, Daniele G. Spampinato, Anurag Kutuluru, Upasana Sridhar, Doru Thom Popovici, Franz Franchetti, and Scott McMillan. 2018. Linear Algebraic Formulation of Edge-centric K-truss Algorithms with Adjacency Matrices. 1\u20137."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"}],"event":{"name":"PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Phoenix AZ USA","acronym":"PLDI '19"},"container-title":["Proceedings of the 6th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3315454.3329962","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3315454.3329962","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3315454.3329962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:33Z","timestamp":1750204413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3315454.3329962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,8]]},"references-count":10,"alternative-id":["10.1145\/3315454.3329962","10.1145\/3315454"],"URL":"https:\/\/doi.org\/10.1145\/3315454.3329962","relation":{},"subject":[],"published":{"date-parts":[[2019,6,8]]},"assertion":[{"value":"2019-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}