Order optimal information spreading using algebraic gossip
DOI10.1145/1993806.1993883zbMATH Open1321.68016OpenAlexW2010682628MaRDI QIDQ5892124FDOQ5892124
Authors: Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker 
Publication date: 11 September 2015
Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993806.1993883
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Cites Work
- Title not available (Why is that?)
- Flooding time in edge-Markovian dynamic graphs
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Parsimonious flooding in dynamic graphs
- Distributed computation in dynamic networks
- Continuous consensus via common knowledge
- Reaching Agreement in the Presence of Faults
- Knowledge and common knowledge in a distributed environment
- Perfectly secure message transmission
- Programming simultaneous actions using common knowledge
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Consensus algorithms with one-bit messages
- Broadcasting in dynamic radio networks
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Fault Tolerance in Networks of Bounded Degree
- Optimal gradient clock synchronization in dynamic networks
- Almost-Everywhere Secure Computation
- Gradient clock synchronization in dynamic networks
Cited In (2)
This page was built for publication: Order optimal information spreading using algebraic gossip
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892124)
