{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:56:18Z","timestamp":1760043378836,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,12]],"date-time":"2017-11-12T00:00:00Z","timestamp":1510444800000},"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":[[2017,11,12]]},"DOI":"10.1145\/3149704.3149764","type":"proceedings-article","created":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T12:36:10Z","timestamp":1509712570000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Parallel Depth-First Search for Directed Acyclic Graphs"],"prefix":"10.1145","author":[{"given":"Maxim","family":"Naumov","sequence":"first","affiliation":[{"name":"NVIDIA Corporation, Santa Clara, CA"}]},{"given":"Alysson","family":"Vrielink","sequence":"additional","affiliation":[{"name":"Stanford University, Menlo Park, CA"}]},{"given":"Michael","family":"Garland","sequence":"additional","affiliation":[{"name":"NVIDIA Corporation, Santa Clara, CA"}]}],"member":"320","published-online":{"date-parts":[[2017,11,12]]},"reference":[{"volume-title":"Proc. Supercomputing 67","year":"2015","author":"Acar U. A.","key":"e_1_3_2_1_1_1"},{"volume-title":"Proc. ACM Symp. Theory of Computing","year":"1987","author":"Aggarwal A.","key":"e_1_3_2_1_2_1"},{"volume-title":"Proc. ACM Symp. Theory of Computing","year":"1989","author":"Aggarwal A.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219025"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1155-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90003-5"},{"key":"e_1_3_2_1_8_1","unstructured":"G. E. Blelloch. 1990. Prefix Sums and Their Applications. CMU CS-TR-190 (1990).  G. E. Blelloch. 1990. Prefix Sums and Their Applications. CMU CS-TR-190 (1990)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_1_10_1","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2001. Introduction to Algorithms. The MIT Press Camb. MA.  T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2001. Introduction to Algorithms. The MIT Press Camb. MA."},{"volume-title":"Proc. IEEE International Symp. Parallel and Distributed Processing","year":"2014","author":"Davidson A.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","unstructured":"T. Davis. 2016. The University of Florida Sparse Matrix Collection. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/ (2016).  T. Davis. 2016. The University of Florida Sparse Matrix Collection. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/ (2016)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1025"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01937481"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90033-C"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219047"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321852"},{"key":"e_1_3_2_1_18_1","unstructured":"J. JaJa. 1992. An Introduction to Parallel Algorithms. Addison-Wesley.  J. JaJa. 1992. An Introduction to Parallel Algorithms. Addison-Wesley."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781315388021"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90375-4"},{"volume-title":"Proc. Int. Symp. Parallel Alg. Arch. Syn.","year":"1997","author":"Ma J.","key":"e_1_3_2_1_21_1"},{"volume-title":"Proc. ACM SIGPLAN Symp. Principles and Practice of Parallel Programming","year":"2012","author":"Merrill D.","key":"e_1_3_2_1_22_1"},{"key":"e_1_3_2_1_23_1","unstructured":"S. Muchnick. 1997. Advanced Compiler Design and Implementation. Morgan Kaufmann San Francisco CA.  S. Muchnick. 1997. Advanced Compiler Design and Implementation. Morgan Kaufmann San Francisco CA."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.862207"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90024-9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90172-X"},{"key":"e_1_3_2_1_27_1","unstructured":"G. Shannon. 1988. A Linear-Processor Algorithm for Depth-First Search in Planar Graphs. Purdue University CS-TR-737 (1988).  G. Shannon. 1988. A Linear-Processor Algorithm for Depth-First Search in Planar Graphs. Purdue University CS-TR-737 (1988)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215058"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan and U. Vishkin. 1984. Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time. Foundations of Computer Science (1984) 12--20.  R. E. Tarjan and U. Vishkin. 1984. Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time. Foundations of Computer Science (1984) 12--20.","DOI":"10.1109\/SFCS.1984.715896"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676830"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214061"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","DOI":"10.1145\/2851141.2851145","volume-title":"Gunrock: A High-Performance Graph Processing Library on the GPU. Proc. ACM SIGPLAN Symp. Principles and Practice of Parallel Programming","author":"Wang Y.","year":"2016"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01933745"}],"event":{"name":"SC '17: The International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"],"location":"Denver CO USA","acronym":"SC '17"},"container-title":["Proceedings of the Seventh Workshop on Irregular Applications: Architectures and Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3149704.3149764","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3149704.3149764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:08Z","timestamp":1750212668000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3149704.3149764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,12]]},"references-count":34,"alternative-id":["10.1145\/3149704.3149764","10.1145\/3149704"],"URL":"https:\/\/doi.org\/10.1145\/3149704.3149764","relation":{},"subject":[],"published":{"date-parts":[[2017,11,12]]},"assertion":[{"value":"2017-11-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}