Strong Robustness of Randomized Rumor Spreading Protocols

DOI10.1007/978-3-642-10631-6_82zbMath1195.68022arXiv1001.3056OpenAlexW2568454291MaRDI QIDQ3652267

Benjamin Doerr, Anna Huber, Ariel Levavi

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.3056

Mathematics Subject Classification ID

Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication

This page was built for publication: Strong Robustness of Randomized Rumor Spreading Protocols