Communication complexity of quasirandom rumor spreading

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6346 LNCS, Issue PART 1, 2010, Pages 134-145

  Berenbrink, Petra ^a   Elsässer, Robert ^b   Sauerwald, Thomas ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BI-DIRECTIONAL COMMUNICATION; COMMUNICATION COMPLEXITY; HYPER-CUBES; LOWER BOUNDS; MESSAGE TRANSMISSIONS; OBLIVIOUS ALGORITHMS; PHONE CALLS; QUASI-RANDOM; RANDOM GRAPHS; RANDOM PHONE CALLS; RUMOR SPREADING; RUNTIMES;

GEOMETRY; GRAPH THEORY; TELEPHONE; TELEPHONE SETS;

ALGORITHMS;

EID: 78249260624     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15775-2_12     Document Type: Conference Paper

References (17)

1. Berenbrink, P., Elsässer, R., Friedetzky, T.: Efficient Randomised Broadcasting in Random Regular Networks with Applications in Peer-to-Peer Systems. In: Proc. of PODC 2008, pp. 155-164 (2008)
2. Berenbrink, P., Elsässer, R., Sauerwald, T.: Randomised Broadcasting: Memory vs. Randomness. In: Proc. of LATIN 2010 (to appear, 2010)
3. Bollobás, B.: Random Graphs. Academic Press, London (1985)
4. Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost Tight Bounds for Rumour Spreading with Conductance. In: Proc. of STOC 2010 (to appear, 2010)
5. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proc. of PODC 1987, pp. 1-12 (1987)
6. Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom Rumor Spreading. In: Proc. of SODA 2008, pp. 773-781 (2008)
7. Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading: expanders, push vs. pull, and robustness. In: Proc. of ICALP 2009, pp. 366-377 (2009)
8. Elsässer, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: Proc. of SPAA 2006, pp. 148-157 (2006)
9. Elsässer, R., Sauerwald, T.: The power of memory in randomized broadcasting. In: Proc. of SODA 2008, pp. 218-227 (2008)
10. Erdocombining double acute accents, P., Rényi, A.: On random graphs I. Publ. Math. Debrecen 6, 290-297 (1959)
11. Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Structures and Algorithms 1(4), 447-460 (1990)
12. Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics 10, 57-77 (1985)
13. Fountoulakis, N., Huber, A., Panagiotou, K.: Reliable broadcasting in random networks and the effect of density. In: Proc. of INFOCOM 2010 (to appear, 2010)
14. Hagerup, T., Rüb, C.: A guided tour of Chernoff bounds. Information Processing Letters 36(6), 305-308 (1990)
15. Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized rumor spreading. In: Proc. of FOCS 2000, pp. 565-574 (2000)
16. McDiarmid, C.: On the method of bounded differences. In: Surveys in Combinatorics. London Math. Soc. Lectures Notes, vol. 141, pp. 148-188. Cambridge Univ. Press, Cambridge (1989)
17. Pittel, B.: On spreading rumor. SIAM Journal on Applied Mathematics 47(1), 213-223 (1987)