Tight bounds for quasirandom rumor spreading

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

zbMATH Keywords

quasirandom broadcastingquasirandom protocol

Mathematics Subject Classification ID

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

Related Items (7)

The Range of a Rotor Walk ⋮ Deterministic Random Walks for Rapidly Mixing Chains ⋮ Quasi-random rumor spreading: reducing randomness can be costly ⋮ Direction-reversing quasi-random rumor spreading with restarts ⋮ Order optimal information spreading using algebraic gossip ⋮ Introducing Quasirandomness to Computer Science ⋮ Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting

This page was built for publication: Tight bounds for quasirandom rumor spreading