Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
From MaRDI portal
Publication:3638048
DOI10.1007/978-3-642-02927-1_31zbMath1195.68021OpenAlexW1771950282MaRDI QIDQ3638048
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_31
Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (14)
Randomised broadcasting: memory vs. randomness ⋮ Rumor Spreading with No Dependence on Conductance ⋮ Confidential gossip ⋮ Direction-reversing quasi-random rumor spreading with restarts ⋮ The worst case behavior of randomized gossip protocols ⋮ Meeting the deadline: on the complexity of fault-tolerant continuous gossip ⋮ Asymptotically Optimal Randomized Rumor Spreading ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fast Simulation of Large-Scale Growth Models ⋮ Introducing Quasirandomness to Computer Science ⋮ Breaking the \(\log n\) barrier on rumor spreading ⋮ Quasirandom Rumor Spreading on Expanders ⋮ Communication complexity of quasirandom rumor spreading
This page was built for publication: Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
