Quasi-random rumor spreading: reducing randomness can be costly
From MaRDI portal
Publication:1944078
DOI10.1016/j.ipl.2010.11.006zbMath1259.05164arXiv1008.0501MaRDI QIDQ1944078
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.0501
Related Items
Abelian networks IV. Dynamics of nonhalting networks, Simple and optimal randomized fault-tolerant rumor spreading
Cites Work
- Unnamed Item
- The shortest-path problem for graphs with random arc-lengths
- On the power of two-point based sampling
- Realistic analysis of some randomized algorithms
- Tight bounds for quasirandom rumor spreading
- Randomized algorithms and pseudorandom numbers
- A Time-Randomness Trade-Off for Oblivious Routing
- On Spreading a Rumor