P. Berenbrink, R. Elsässer, and T. Friedetzky, Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems, 27th ACM Symp. on Principles of Dist. Comp. (PODC), pp.155-164, 2008.

A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database maintenance, 6th ACM Symp. on Princip. of Dist. Comp. (PODC), pp.1-12, 1987.

B. Doerr, T. Friedrich, and T. Sauerwald, Quasirandom rumor spreading, Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.773-781, 2008.

B. Doerr, T. Friedrich, and T. Sauerwald, Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness, Proc. 36th Int. Colloq. on Automata, Languages and Programming (ICALP), pp.366-377, 2009.
DOI : 10.1007/978-3-642-02927-1_31

R. Elsässer, On Randomized Broadcasting in Power Law Networks, Proc. 20th Int. Symp. on Distributed Computing (DISC), pp.370-384, 2006.
DOI : 10.1007/11864219_26

R. Elsässer, On the communication complexity of randomized broadcasting in random-like graphs, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '06, pp.148-157, 2006.
DOI : 10.1145/1148109.1148135

R. Elsässer and T. Sauerwald, The power of memory in randomized broadcasting, Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.218-227, 2008.

U. Feige, D. Peleg, P. Raghavan, and E. Upfal, Randomized broadcast in networks, Random Structures and Algorithms, vol.47, issue.4, pp.447-460, 1990.
DOI : 10.1002/rsa.3240010406

A. Frieze and G. Grimmett, The shortest-path problem for graphs with random arc-lengths, Discrete Applied Mathematics, vol.10, issue.1, pp.57-77, 1985.
DOI : 10.1016/0166-218X(85)90059-9

R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, Randomized rumor spreading, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.565-574, 2000.
DOI : 10.1109/SFCS.2000.892324