{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T18:29:25Z","timestamp":1792952965331,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"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":[[2010,6,13]]},"DOI":"10.1145\/1810479.1810534","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"303-314","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":125,"title":["A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)"],"prefix":"10.1145","author":[{"given":"Charles E.","family":"Leiserson","sequence":"first","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao B.","family":"Schardl","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277678"},{"key":"e_1_3_2_1_2_1","volume-title":"HPCS scalable synthetic compact applications #2","author":"Bader D.","year":"2007","unstructured":"D. Bader , J. Feo , J. Gilbert , J. Kepner , D. Keoster , E. Loh , K. Madduri , B. Mann , and T. Meuse . HPCS scalable synthetic compact applications #2 , 2007 . Available at http:\/\/www.graphanalysis.org\/benchmark\/HPCS-SSCA2_Graph-Theory_v2.2.doc%. D. Bader, J. Feo, J. Gilbert, J. Kepner, D. Keoster, E. Loh, K. Madduri, B. Mann, and T. Meuse. HPCS scalable synthetic compact applications #2, 2007. Available at http:\/\/www.graphanalysis.org\/benchmark\/HPCS-SSCA2_Graph-Theory_v2.2.doc%."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.34"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793259471"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.88"},{"key":"e_1_3_2_1_10_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Press , third edition, 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, third edition, 2009."},{"key":"e_1_3_2_1_11_1","volume-title":"University of Florida sparse matrix collection","author":"Davis T. A.","year":"2010","unstructured":"T. A. Davis . University of Florida sparse matrix collection , 2010 . Available at http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/. T. A. Davis. University of Florida sparse matrix collection, 2010. Available at http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645461.654859"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.21127"},{"issue":"3","key":"e_1_3_2_1_14_1","first-page":"301","article-title":"Efficient detection of determinacy races in Cilk programs","volume":"32","author":"Feng M.","year":"1999","unstructured":"M. Feng and C. E. Leiserson . Efficient detection of determinacy races in Cilk programs . TCS , 32 ( 3 ): 301 -- 326 , 1999 . M. Feng and C. E. Leiserson. Efficient detection of determinacy races in Cilk programs. TCS, 32(3):301--326, 1999.","journal-title":"TCS"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584017"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827594275339"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"e_1_3_2_1_19_1","volume-title":"Multicore-enabling the Murphi verification tool. Available from http:\/\/software.intel.com\/en-us\/articles\/multicore-enabling-the-murphi-verification-tool\/","author":"He Y.","year":"2009","unstructured":"Y. He . Multicore-enabling the Murphi verification tool. Available from http:\/\/software.intel.com\/en-us\/articles\/multicore-enabling-the-murphi-verification-tool\/ , 2009 . Y. He. Multicore-enabling the Murphi verification tool. Available from http:\/\/software.intel.com\/en-us\/articles\/multicore-enabling-the-murphi-verification-tool\/, 2009."},{"key":"e_1_3_2_1_20_1","unstructured":"Intel Corporation. Intel Cilk++ SDK Programmer's Guide 2009. Document Number: 322581-001US.  Intel Corporation. Intel Cilk++ SDK Programmer's Guide 2009. Document Number: 322581-001US."},{"key":"e_1_3_2_1_21_1","first-page":"1380","volume-title":"AAAI","author":"Korf R. E.","year":"2005","unstructured":"R. E. Korf and P. Schultze . Large-scale parallel breadth-first search . In AAAI , pages 1380 -- 1385 , 2005 . R. E. Korf and P. Schultze. Large-scale parallel breadth-first search. In AAAI, pages 1380--1385, 2005."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219222"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0405-3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/3121445.3121464"},{"key":"e_1_3_2_1_25_1","first-page":"106","volume-title":"ASE","author":"Lubos J. B.","year":"2003","unstructured":"J. B. Lubos , L. Brim , and J. Chaloupka . Parallel breadth-first search LTL model-checking . In ASE , pages 106 -- 115 , 2003 . J. B. Lubos, L. Brim, and J. Chaloupka. Parallel breadth-first search LTL model-checking. In ASE, pages 106--115, 2003."},{"key":"e_1_3_2_1_26_1","first-page":"285","volume-title":"Int. Symp. on Th. of Switching","author":"Moore E. F.","year":"1959","unstructured":"E. F. Moore . The shortest path through a maze . In Int. Symp. on Th. of Switching , pages 285 -- 292 , 1959 . E. F. Moore. The shortest path through a maze. In Int. Symp. on Th. of Switching, pages 285--292, 1959."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/130616.130623"},{"key":"e_1_3_2_1_28_1","first-page":"1","volume-title":"USENIX","author":"Stein D.","year":"1992","unstructured":"D. Stein and D. Shah . Implementing lightweight threads . In USENIX , pages 1 -- 9 , 1992 . D. Stein and D. Shah. Implementing lightweight threads. In USENIX, pages 1--9, 1992."},{"key":"e_1_3_2_1_29_1","volume-title":"Addison-Wesley","author":"Stroustrup B.","year":"2000","unstructured":"B. Stroustrup . The C Programming Language . Addison-Wesley , third edition, 2000 . B. Stroustrup. The C Programming Language. Addison-Wesley, third edition, 2000."},{"key":"e_1_3_2_1_30_1","unstructured":"Supertech Research Group MIT\/LCS. Cilk 5.4.6 Reference Manual 1998. Available from http:\/\/supertech.csail.mit.edu\/cilk\/.  Supertech Research Group MIT\/LCS. Cilk 5.4.6 Reference Manual 1998. Available from http:\/\/supertech.csail.mit.edu\/cilk\/."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.2002.7095"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.4"},{"key":"e_1_3_2_1_33_1","volume-title":"AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications","author":"Zhang Y.","year":"2006","unstructured":"Y. Zhang and E. A. Hansen . Parallel breadth-first heuristic search on a shared-memory architecture . In AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications , 2006 . Y. Zhang and E. A. Hansen. Parallel breadth-first heuristic search on a shared-memory architecture. In AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications, 2006."}],"event":{"name":"SPAA 10: 22nd ACM Symposium on Parallelism in Algorithms and Architectures","location":"Thira Santorini Greece","acronym":"SPAA 10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810479.1810534","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810479.1810534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:23Z","timestamp":1750245803000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810479.1810534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":33,"alternative-id":["10.1145\/1810479.1810534","10.1145\/1810479"],"URL":"https:\/\/doi.org\/10.1145\/1810479.1810534","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}