A Work-Efficient Parallel Breadth-First Search Algorithm (or How to Cope with the Nondeterminism of Reducers). Leiserson, C. E. & Schardl, T. B. In SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, pages 303-314, June, 2010. ![A Work-Efficient Parallel Breadth-First Search Algorithm (or How to Cope with the Nondeterminism of Reducers) [link]](https://bibbase.org/img/filetypes/link.svg "link")
Link bibtex @inproceedings{LeisersonSc10,
Author = {Charles E. Leiserson and Tao B. Schardl},
Booktitle = {SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures},
Ee = {http://doi.acm.org/10.1145/1810479.1810534},
Group = {Supertech},
Localfile = {pbfs},
Month = jun,
Pages = {303-314},
Title = {A Work-Efficient Parallel Breadth-First Search Algorithm (or How to Cope with the Nondeterminism of Reducers)},
Year = {2010}}
Downloads: 0
{"_id":"8aLNFQLeAXCqWgi5x","bibbaseid":"leiserson-schardl-aworkefficientparallelbreadthfirstsearchalgorithmorhowtocopewiththenondeterminismofreducers-2010","author_short":["Leiserson, C. E.","Schardl, T. B."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Charles","E."],"propositions":[],"lastnames":["Leiserson"],"suffixes":[]},{"firstnames":["Tao","B."],"propositions":[],"lastnames":["Schardl"],"suffixes":[]}],"booktitle":"SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures","ee":"http://doi.acm.org/10.1145/1810479.1810534","group":"Supertech","localfile":"pbfs","month":"June","pages":"303-314","title":"A Work-Efficient Parallel Breadth-First Search Algorithm (or How to Cope with the Nondeterminism of Reducers)","year":"2010","bibtex":"@inproceedings{LeisersonSc10,\n\tAuthor = {Charles E. Leiserson and Tao B. Schardl},\n\tBooktitle = {SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures},\n\tEe = {http://doi.acm.org/10.1145/1810479.1810534},\n\tGroup = {Supertech},\n\tLocalfile = {pbfs},\n\tMonth = jun,\n\tPages = {303-314},\n\tTitle = {A Work-Efficient Parallel Breadth-First Search Algorithm (or How to Cope with the Nondeterminism of Reducers)},\n\tYear = {2010}}\n\n","author_short":["Leiserson, C. E.","Schardl, T. B."],"key":"LeisersonSc10","id":"LeisersonSc10","bibbaseid":"leiserson-schardl-aworkefficientparallelbreadthfirstsearchalgorithmorhowtocopewiththenondeterminismofreducers-2010","role":"author","urls":{"Link":"http://doi.acm.org/10.1145/1810479.1810534"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/6tzZkfSdk3MbxhYJP","dataSources":["S6rxMtE3tWZEMP8Aj","GiatBC6WGXpsfRtpv"],"keywords":[],"search_terms":["work","efficient","parallel","breadth","first","search","algorithm","cope","nondeterminism","reducers","leiserson","schardl"],"title":"A Work-Efficient Parallel Breadth-First Search Algorithm (or How to Cope with the Nondeterminism of Reducers)","year":2010}