Order optimal information spreading using algebraic gossip

DOI10.1007/S00446-013-0187-YzbMath1271.68066arXiv1101.4372OpenAlexW2014394992MaRDI QIDQ5891123

Chen Avin, Keren Censor-Hillel, Michael Borokhovich, Zvi Lotker

Publication date: 26 August 2013

Published in: Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

network capacitynetwork codingconductancealgebraic gossipgossip algorithmsinformation spreading

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (1)

Distributed computation in dynamic networks via random walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On collaborative content distribution using multi-message gossip
• Tight bounds for quasirandom rumor spreading
• Random Graphs and Complex Networks
• Bounds for algebraic gossip on graphs
• On the complexity of asynchronous gossip
• Randomized broadcast in networks
• Queueing Modelling Fundamentals
• Linear network coding
• Computing separable functions via gossip
• Global computation in a poorly connected world
• Analyzing network coding gossip made easy
• Probability and Computing

This page was built for publication: Order optimal information spreading using algebraic gossip