ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016


Article Details
Title: Better Bounds for Coalescing-Branching Random Walks
Article URLs:
Alternative Article URLs:
Authors: Michael Mitzenmacher
  • Harvard University
Rajmohan Rajaraman
  • Northeastern University
Scott T. Roche
  • Northeastern University
  • Akamai Technologies Inc., USA
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1228598, 1320231, 1535795, 1422715, 1535929, 1216038
DBLP Key: conf/spaa/MitzenmacherRR16
Author Comments:

Discuss this paper and its artifacts below