Rumor spreading with no dependence on conductance
From MaRDI portal
Publication:2963582
DOI10.1137/14099992XzbMATH Open1359.68024OpenAlexW2583780251MaRDI QIDQ2963582FDOQ2963582
Authors: Keren Censor-Hillel, Bernhard Haeupler, Jonathan Kelner, Petar Maymounkov 
Publication date: 15 February 2017
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/14099992x
Recommendations
Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Spectral sparsification of graphs
- Title not available (Why is that?)
- Distributed Computing: A Locality-Sensitive Approach
- Lower bound of the Hadwiger number of graphs by their average degree
- Forests, frames, and games: Algorithms for matroid sums and applications
- Low distortion spanners
- An Optimal Synchronizer for the Hypercube
- Title not available (Why is that?)
- Graph spanners
- Global computation in a poorly connected world
- Additive spanners and \(({\alpha}, {\beta})\)-spanners
- Fully dynamic randomized algorithms for graph spanners
- Randomized broadcast in networks
- Title not available (Why is that?)
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
- Social networks spread rumors in sublogarithmic time
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- Spatial gossip and resource location protocols
- Almost tight bounds for rumour spreading with conductance
- Tight bounds for rumor spreading in graphs of a given conductance
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asynchronous gossip
- Computing separable functions via gossip
- Sublinear fully distributed partition with applications
- On the locality of distributed sparse spanner construction
- Asymptotically optimal randomized rumor spreading
- Rumor spreading and vertex expansion
- Asynchronous Rumor Spreading in Preferential Attachment Graphs
- Ultra-fast rumor spreading in social networks
- Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
- Simple, fast and deterministic gossip and rumor spreading
- Tight bounds for rumor spreading with vertex expansion
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Low randomness rumor spreading via hashing
- Fast information spreading in graphs with large weak conductance
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)
