Faster rumor spreading with multiple calls
From MaRDI portal
Publication:2256120
zbMath1317.68018MaRDI QIDQ2256120
Ali Pourmiri, Thomas Sauerwald, Konstantinos D. Panagiotou
Publication date: 19 February 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p23
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12)
Related Items (4)
Stochastic analysis of rumor spreading with multiple pull operations ⋮ Continuous-time stochastic analysis of rumor spreading with multiple operations ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Theory and Practice of Discrete Interacting Agents Models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The shortest-path problem for graphs with random arc-lengths
- Probabilistic methods for algorithmic discrete mathematics
- Almost tight bounds for rumour spreading with conductance
- Asynchronous Rumor Spreading in Preferential Attachment Graphs
- Resource discovery in distributed networks
- Asymptotically Optimal Randomized Rumor Spreading
- Randomized broadcast in networks
- Rumor Spreading on Random Regular Graphs and Expanders
- Fast Distributed Algorithms for Computing Separable Functions
- Rumor Spreading in Social Networks
- MANETS: High Mobility Can Make Up for Low Transmission Power
- On Spreading a Rumor
- Partial information spreading with application to distributed maximum coverage
- Social networks spread rumors in sublogarithmic time
- On the Runtime and Robustness of Randomized Broadcasting
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Concentration of Measure for the Analysis of Randomized Algorithms
This page was built for publication: Faster rumor spreading with multiple calls
