Randomised broadcasting: memory vs. randomness

DOI10.1016/J.TCS.2013.08.011MaRDI QIDQ391757zbMATH OpenOpenAlexFDO

Authors Petra Berenbrink, Robert Elsässer, 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

zbMATH Keywords

distributed computingbroadcastingexpander graphsrandomised algorithm

Mathematics Subject Classification ID

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

Recommendations

• Randomised Broadcasting: Memory vs. Randomness
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
• Efficient Information Exchange in the Random Phone-Call Model
• Efficient broadcasting in random power law networks

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• scientific article; zbMATH DE number 5764860 (Why is no real title available?)
• scientific article; zbMATH DE number 5764878 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A guided tour of Chernoff bounds
• Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
• Communication complexity of quasirandom rumor spreading
• Efficient broadcasting in random power law networks
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
• Eigenvalues and expansion of regular graphs
• Emergence of Scaling in Random Networks
• Explicit Concentrators from Generalized N-Gons
• On Spreading a Rumor
• Pseudo-random graphs
• Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
• Randomised Broadcasting: Memory vs. Randomness
• Randomized broadcast in networks
• Social networks spread rumors in sublogarithmic time
• The shortest-path problem for graphs with random arc-lengths

Cited in

(3)

• Efficient broadcasting in random power law networks
• Randomised Broadcasting: Memory vs. Randomness
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391757)