Analyzing network coding gossip made easy
From MaRDI portal
Publication:5419099
DOI10.1145/1993636.1993676zbMath1288.68021arXiv1010.0558OpenAlexW2094856687MaRDI QIDQ5419099
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.0558
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Network protocols (68M12)
Related Items (12)
On fast and robust information spreading in the vertex-congest model ⋮ Bounds for algebraic gossip on graphs ⋮ Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication ⋮ Causality, influence, and computation in possibly disconnected synchronous dynamic networks ⋮ Randomized broadcast in radio networks with collision detection ⋮ Order optimal information spreading using algebraic gossip ⋮ The cost of global broadcast in dynamic radio networks ⋮ Bounded-contention coding for the additive network model ⋮ Simple multi-party set reconciliation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Distributed computation in dynamic networks via random walks
This page was built for publication: Analyzing network coding gossip made easy
