Two new gossip algorithms achieve fast rumor spreading with polylog n message sizes: one in O(c log n / Φ_c) rounds optimal in weak conductance, and one in Õ(D + √n) rounds independent of conductance.
Kelner, and Petar Maymounkov
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fast Gossip-based Rumor Spreading using Small Messages
Two new gossip algorithms achieve fast rumor spreading with polylog n message sizes: one in O(c log n / Φ_c) rounds optimal in weak conductance, and one in Õ(D + √n) rounds independent of conductance.