On the Push&Pull Protocol for Rumour Spreading
Authors:
- 28 February 2017
- book chapter
- Published by Springer Nature
- p. 3-10
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Tight Bounds for Rumor Spreading with Vertex Expansion2013
- Asynchronous Rumor Spreading on Random Graphs2013
- Flooding in Weighted Sparse Random GraphsSIAM Journal on Discrete Mathematics, 2013
- Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary DimensionsAlgorithmica, 2012
- Ultra-Fast Rumor Spreading in Social Networks2012
- Models of First-Passage Percolation2004
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random WeightsCombinatorics, Probability and Computing, 1999
- Percolation, First-Passage Percolation and Covering Times for Richardson's Model on the $n$-CubeThe Annals of Applied Probability, 1993
- Randomized broadcast in networksRandom Structures & Algorithms, 1990
- A survey of gossiping and broadcasting in communication networksNetworks, 1988