On the Runtime and Robustness of Randomized Broadcasting

DOI10.1007/11940128_36zbMATH Open1135.90314OpenAlexW1785338928MaRDI QIDQ5459130FDOQ5459130

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

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

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

Cited In (27)

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

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)