On the Runtime and Robustness of Randomized Broadcasting

DOI10.1007/11940128_36MaRDI QIDQ5459130zbMATH OpenOpenAlexFDO

Authors Robert Elsässer, Thomas Sauerwald

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_36

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Randomized algorithms (68W20) Communication networks in operations research (90B18)

Recommendations

• On the runtime and robustness of randomized broadcasting
• On randomized broadcasting in star graphs
• Graph-Theoretic Concepts in Computer Science
• Radio communication in random graphs
• scientific article; zbMATH DE number 2089989

Cited in

(27)

• On randomized broadcasting in star graphs
• Reliability versus cost: Design of a probabilistic broadcast algorithm
• Round robin is optimal for fault-tolerant broadcasting on wireless networks
• Close-to-optimal and near-optimal broadcasting in random graphs
• Breaking the \(\log n\) barrier on rumor spreading
• Faster rumor spreading with multiple calls
• Direction-reversing quasi-random rumor spreading with restarts
• An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
• Efficient broadcasting in random power law networks
• Randomized broadcast in networks
• Randomised Broadcasting: Memory vs. Randomness
• Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
• Introducing Quasirandomness to Computer Science
• Strong robustness of randomized rumor spreading protocols
• scientific article; zbMATH DE number 1875436 (Why is no real title available?)
• Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
• scientific article; zbMATH DE number 7318978 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2004
• The Weighted Coupon Collector’s Problem and Applications
• Broadcast Extensions with Optimal Communication and Round Complexity
• On Mixing and Edge Expansion Properties in Randomized Broadcasting
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
• Graph-Theoretic Concepts in Computer Science
• Broadcasting in hypercubes with randomly distributed Byzantine faults
• On the runtime and robustness of randomized broadcasting
• On mixing and edge expansion properties in randomized broadcasting
• Agent-based randomized broadcasting in large networks

This page was built for publication: On the Runtime and Robustness of Randomized Broadcasting

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