%0 Conference Paper %1 conf/spaa/LeisersonS10 %A Leiserson, Charles E. %A Schardl, Tao B. %B SPAA %D 2010 %E auf der Heide, Friedhelm Meyer %E Phillips, Cynthia A. %I ACM %K dblp %P 303-314 %T A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). %U http://dblp.uni-trier.de/db/conf/spaa/spaa2010.html#LeisersonS10 %@ 978-1-4503-0079-7

@inproceedings{conf/spaa/LeisersonS10, added-at = {2018-11-06T00:00:00.000+0100}, author = {Leiserson, Charles E. and Schardl, Tao B.}, biburl = {https://www.bibsonomy.org/bibtex/2fe0889a8fece19b3e582275f5e0cadd8/dblp}, booktitle = {SPAA}, crossref = {conf/spaa/2010}, editor = {auf der Heide, Friedhelm Meyer and Phillips, Cynthia A.}, ee = {https://doi.org/10.1145/1810479.1810534}, interhash = {8bb0c5aa6be75439937a5b77a92afe41}, intrahash = {fe0889a8fece19b3e582275f5e0cadd8}, isbn = {978-1-4503-0079-7}, keywords = {dblp}, pages = {303-314}, publisher = {ACM}, timestamp = {2018-11-22T11:51:44.000+0100}, title = {A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers).}, url = {http://dblp.uni-trier.de/db/conf/spaa/spaa2010.html#LeisersonS10}, year = 2010 }