Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche. Better Bounds for Coalescing-Branching Random Walks. In Christian Scheideler, Seth Gilbert, editors, Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016. pages 313-323, ACM, 2016. [doi]
@inproceedings{MitzenmacherRR16,
title = {Better Bounds for Coalescing-Branching Random Walks},
author = {Michael Mitzenmacher and Rajmohan Rajaraman and Scott T. Roche},
year = {2016},
doi = {10.1145/2935764.2935791},
url = {http://doi.acm.org/10.1145/2935764.2935791},
researchr = {https://researchr.org/publication/MitzenmacherRR16},
cites = {0},
citedby = {0},
pages = {313-323},
booktitle = {Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016},
editor = {Christian Scheideler and Seth Gilbert},
publisher = {ACM},
isbn = {978-1-4503-4210-0},
}