Tight bounds for quasirandom rumor spreading
From MaRDI portal
Publication:2380260
zbMath1195.68020MaRDI QIDQ2380260
Spyros Angelopoulos, Anna Huber, Benjamin Doerr, Konstantinos D. Panagiotou
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/233230
68M12: Network protocols
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
The Range of a Rotor Walk, Deterministic Random Walks for Rapidly Mixing Chains, Order optimal information spreading using algebraic gossip, Quasi-random rumor spreading: reducing randomness can be costly, Direction-reversing quasi-random rumor spreading with restarts, Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting, Introducing Quasirandomness to Computer Science