Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
From MaRDI portal
Publication:5891998
Recommendations
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Randomized broadcast in networks
- Optimal and near-optimal broadcast in random graphs
- On the Runtime and Robustness of Randomized Broadcasting
- On the runtime and robustness of randomized broadcasting
- On Randomized Broadcasting in Power Law Networks
- Close-to-optimal and near-optimal broadcasting in random graphs
- Efficient broadcasting in random power law networks
- Broadcasting in random graphs
Cited in
(17)- Randomised broadcasting: memory vs. randomness
- Asymptotically optimal randomized rumor spreading
- Introducing Quasirandomness to Computer Science
- Faster rumor spreading with multiple calls
- Perfect broadcasting in unlabeled networks
- Efficient broadcasting in random power law networks
- Randomized broadcast in networks
- The worst case behavior of randomized gossip protocols
- The role of randomness in the broadcast congested clique model
- scientific article; zbMATH DE number 7318978 (Why is no real title available?)
- Choosing a random peer
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Probabilistic flooding for efficient information dissemination in random graph topologies
- Breaking the \(\log n\) barrier on rumor spreading
- Communication complexity of quasirandom rumor spreading
- On Randomized Broadcasting in Power Law Networks
- An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network
This page was built for publication: Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891998)