Simple, Fast and Deterministic Gossip and Rumor Spreading

DOI10.1145/2767126zbMath1421.68131arXiv1210.1193OpenAlexW1571006103WikidataQ130894426 ScholiaQ130894426MaRDI QIDQ3177753

Bernhard Haeupler

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

distributed computinglocal modelinformation disseminationrumor spreadinggossip

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Network protocols (68M12)

Related Items (9)

On fast and robust information spreading in the vertex-congest model ⋮ Global stability of a two-mediums rumor spreading model with media coverage ⋮ Everyone knows that everyone knows ⋮ Dynamic gossip ⋮ On the complexity of the shortest-path broadcast problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Rumor spreading with bounded in-degree ⋮ Robustness of randomized rumour spreading

This page was built for publication: Simple, Fast and Deterministic Gossip and Rumor Spreading