Randomised broadcasting: memory vs. randomness
From MaRDI portal
Publication:391757
DOI10.1016/j.tcs.2013.08.011zbMath1358.68037OpenAlexW2077734953MaRDI QIDQ391757
Robert Elsässer, Petra Berenbrink, Thomas Sauerwald
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.08.011
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A guided tour of Chernoff bounds
- The shortest-path problem for graphs with random arc-lengths
- Efficient Broadcasting in Random Power Law Networks
- Emergence of Scaling in Random Networks
- Randomized broadcast in networks
- Explicit Concentrators from Generalized N-Gons
- Randomised Broadcasting: Memory vs. Randomness
- Communication Complexity of Quasirandom Rumor Spreading
- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
- On Spreading a Rumor
- Eigenvalues and expansion of regular graphs
- Social networks spread rumors in sublogarithmic time
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
This page was built for publication: Randomised broadcasting: memory vs. randomness
