On the Runtime and Robustness of Randomized Broadcasting
From MaRDI portal
Publication:5459130
DOI10.1007/11940128_36zbMath1135.90314OpenAlexW1785338928MaRDI QIDQ5459130
Robert Elsässer, Thomas Sauerwald
Publication date: 24 April 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11940128_36
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Randomized algorithms (68W20)
Related Items (9)
On mixing and edge expansion properties in randomized broadcasting ⋮ The Weighted Coupon Collector’s Problem and Applications ⋮ Direction-reversing quasi-random rumor spreading with restarts ⋮ On Mixing and Edge Expansion Properties in Randomized Broadcasting ⋮ Faster rumor spreading with multiple calls ⋮ Efficient Broadcasting in Random Power Law Networks ⋮ On randomized broadcasting in star graphs ⋮ Introducing Quasirandomness to Computer Science ⋮ Breaking the \(\log n\) barrier on rumor spreading
This page was built for publication: On the Runtime and Robustness of Randomized Broadcasting
