Sciweavers

159 search results - page 1 / 32
» Randomized Rumor Spreading
Sort
View
ICALP
2009
Springer
13 years 11 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
SPAA
2010
ACM
13 years 5 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
STACS
2012
Springer
12 years 11 days ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 6 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
FOCS
2000
IEEE
13 years 9 months ago
Randomized Rumor Spreading
Richard M. Karp, Christian Schindelhauer, Scott Sh...