Quasirandom rumor spreading
From MaRDI portal
Recommendations
- Quasirandom Rumor Spreading: An Experimental Analysis
- Quasirandom rumor spreading, an experimental analysis
- Tight bounds for quasirandom rumor spreading
- Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Cited in
(16)- Introducing Quasirandomness to Computer Science
- Dynamic gossip
- Strong robustness of randomized rumor spreading protocols
- Direction-reversing quasi-random rumor spreading with restarts
- The worst case behavior of randomized gossip
- Randomized rumour spreading: the effect of the network topology
- Communication complexity of quasirandom rumor spreading
- A time-randomness tradeoff for quasi-random rumour spreading
- Quasi-random rumor spreading: reducing randomness can be costly
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
- Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
- Quasirandom rumor spreading, an experimental analysis
- Tight bounds for quasirandom rumor spreading
- Quasirandom rumor spreading on expanders
- Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting
- Communication complexity of quasirandom rumor spreading
This page was built for publication: Quasirandom rumor spreading
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962167)