Better Bounds for Coalescing-Branching Random Walks

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]

Abstract

Abstract is missing.