| Title | A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers) |
| Publication Type | Conference Paper |
| Year of Publication | 2010 |
| Authors | Leiserson, Charles E., and Schardl Tao B. |
| Conference Name | SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures |
| Date Published | 06/2010 |
| Publisher | ACM Press |
| Conference Location | Thira, Santorini, Greece |
| ISBN Number | 9781450300797 |
| URL | http://dl.acm.org/citation.cfm?id=1810534 |
| DOI | 10.1145/1810479.1810534 |
| Citation Key | LeisersonSc10 |
| Full Text | |
