On fast and robust information spreading in the vertex-congest model
DOI10.1016/j.tcs.2017.06.010zbMath1407.68185arXiv1507.01181MaRDI QIDQ1625611
Keren Censor-Hillel, Tariq Toukan
Publication date: 29 November 2018
Published in: Theoretical Computer Science, Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.01181
fault tolerance; distributed computing; randomized algorithms; vertex-connectivity; information spreading
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68R10: Graph theory (including graph drawing) in computer science
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W20: Randomized algorithms
68W15: Distributed algorithms
Related Items
Cites Work
- Unnamed Item
- The abstract MAC layer
- On fast and robust information spreading in the vertex-congest model
- Distributed connectivity decomposition
- Simple, Fast and Deterministic Gossip and Rumor Spreading
- Randomized broadcast in networks
- A Random Linear Network Coding Approach to Multicast
- Network information flow
- Distributed Computing: A Locality-Sensitive Approach
- Linear network coding
- Computing separable functions via gossip
- Cover Time and Broadcast Time
- Analyzing network coding gossip made easy
- Probability and Computing