Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance
Original manuscript April 14, 2011
Main Authors: | Censor-Hillel, Keren (Contributor), Haeupler, Bernhard (Contributor), Maymounkov, Petar Borissov (Contributor), Kelner, Jonathan Adam (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2013-09-11T15:18:54Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Rumor Spreading with No Dependence on Conductance
by: Censor-Hillel, Keren, et al.
Published: (2017) -
Electric routing and concurrent flow cutting
by: Kelner, Jonathan Adam, et al.
Published: (2018) -
Bounded-Contention Coding for wireless networks in the high SNR regime
by: Censor-Hillel, Keren, et al.
Published: (2016) -
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
by: Censor-Hillel, Keren, et al.
Published: (2014) -
Adaptive rumor spreading
by: Vera Azócar, Alberto Abel
Published: (2015)