On fast and robust information spreading in the vertex-congest model

DOI10.1016/j.tcs.2017.06.010zbMath1407.68185arXiv1507.01181OpenAlexW2704259994MaRDI 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

zbMATH Keywords

fault tolerancedistributed computingrandomized algorithmsvertex-connectivityinformation spreading

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (2)

On fast and robust information spreading in the vertex-congest model ⋮ Sparsifying Congested Cliques and Core-Periphery Networks

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

This page was built for publication: On fast and robust information spreading in the vertex-congest model