scientific article; zbMATH DE number 7525473
From MaRDI portal
Publication:5075774
Recommendations
- Robustness of randomized rumour spreading
- Strong robustness of randomized rumor spreading protocols
- Strong robustness of randomized rumor spreading protocols
- Randomized rumor spreading revisited
- scientific article; zbMATH DE number 6783407
- Asymptotically optimal randomized rumor spreading
- Asymptotically optimal randomized rumor spreading
- Randomized rumour spreading: the effect of the network topology
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
- Quasirandom Rumor Spreading: An Experimental Analysis
Cites work
- Advanced Lectures on Machine Learning
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- Expander graphs and their applications
- Global computation in a poorly connected world
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- Local resilience of graphs
- On the resilience of long cycles in random graphs
- On the runtime and robustness of randomized broadcasting
- Randomized broadcast in networks
- Randomized rumor spreading revisited
- Randomized rumour spreading: the effect of the network topology
- Regularity lemmas for graphs
- Rumor spreading and conductance
- Rumor spreading on random regular graphs and expanders
- Simple, fast and deterministic gossip and rumor spreading
- Social networks spread rumors in sublogarithmic time
- The shortest-path problem for graphs with random arc-lengths
- The String of Diamonds Is Tight for Rumor Spreading
- Tight analysis of randomized rumor spreading in complete graphs
- Tight bounds for rumor spreading in graphs of a given conductance
- Tight bounds for rumor spreading with vertex expansion
- Ultra-fast rumor spreading in social networks
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075774)
