Global computation in a poorly connected world

DOI10.1145/2213977.2214064zbMath1286.68017OpenAlexW2068322213MaRDI QIDQ5415528

Jonathan A. Kelner, Bernhard Haeupler, Petar Maymounkov, Keren Censor-Hillel

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2213977.2214064

zbMATH Keywords

broadcastinformation spreadinggossipsparse spannersexpander decomposition

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Network protocols (68M12)

Related Items (15)

Simple and optimal randomized fault-tolerant rumor spreading ⋮ Unnamed Item ⋮ Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication ⋮ Rumor Spreading with No Dependence on Conductance ⋮ Unnamed Item ⋮ The sparsest additive spanner via multiple weighted BFS trees ⋮ Order optimal information spreading using algebraic gossip ⋮ Probabilistic Analysis of Rumor-Spreading Time ⋮ Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits ⋮ Unnamed Item ⋮ Distributed construction of purely additive spanners ⋮ Rumor spreading with bounded in-degree ⋮ The Sparsest Additive Spanner via Multiple Weighted BFS Trees ⋮ Breaking the \(\log n\) barrier on rumor spreading ⋮ Robustness of randomized rumour spreading

This page was built for publication: Global computation in a poorly connected world