Rumor spreading with no dependence on conductance
From MaRDI portal
(Redirected from Publication:2963582)
Recommendations
Cites work
- Additive spanners and \(({\alpha}, {\beta})\)-spanners
- Almost tight bounds for rumour spreading with conductance
- An Optimal Synchronizer for the Hypercube
- Asymptotically optimal randomized rumor spreading
- Asynchronous gossip
- Asynchronous Rumor Spreading in Preferential Attachment Graphs
- Computing separable functions via gossip
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Distributed Computing: A Locality-Sensitive Approach
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- Fast information spreading in graphs with large weak conductance
- Forests, frames, and games: Algorithms for matroid sums and applications
- Fully dynamic randomized algorithms for graph spanners
- Global computation in a poorly connected world
- Graph spanners
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- scientific article; zbMATH DE number 420886 (Why is no real title available?)
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 5764860 (Why is no real title available?)
- scientific article; zbMATH DE number 6783407 (Why is no real title available?)
- scientific article; zbMATH DE number 6783408 (Why is no real title available?)
- Low distortion spanners
- Low randomness rumor spreading via hashing
- Lower bound of the Hadwiger number of graphs by their average degree
- On the locality of distributed sparse spanner construction
- Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
- Randomized broadcast in networks
- Rumor spreading and vertex expansion
- Simple, fast and deterministic gossip and rumor spreading
- Social networks spread rumors in sublogarithmic time
- Spatial gossip and resource location protocols
- Spectral sparsification of graphs
- Sublinear fully distributed partition with applications
- 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: Rumor spreading with no dependence on conductance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963582)
