Simple, Fast and Deterministic Gossip and Rumor Spreading
From MaRDI portal
Publication:5741759
DOI10.1137/1.9781611973105.51zbMath1421.68132OpenAlexW2952550120MaRDI QIDQ5741759
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973105.51
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
Rumor Spreading with No Dependence on Conductance, Breaking the \(\log n\) barrier on rumor spreading