Randomised Broadcasting: Memory vs. Randomness

DOI10.1007/978-3-642-12200-2_28MaRDI QIDQ3557029zbMATH OpenOpenAlexFDO

Authors Petra Berenbrink, Robert Elsässer, Thomas Sauerwald

Publication date 27 April 2010

Published in LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://www.repository.cam.ac.uk/handle/1810/294029

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18)

Recommendations

• Randomised broadcasting: memory vs. randomness
• On the Runtime and Robustness of Randomized Broadcasting
• On the runtime and robustness of randomized broadcasting
• Randomized broadcast in networks
• scientific article; zbMATH DE number 2083798
• Randomness in distribution protocols
• Randomness in distribution protocols
• Broadcasting with random faults
• Randomized communication versus partition number
• The entropy of a distributed computation random number generation from memory interleaving

Cited in

(5)

• Communication complexity of quasirandom rumor spreading
• Rumor spreading on random regular graphs and expanders
• Rumor spreading on random regular graphs and expanders
• 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 Q3557029)