Alon, N. and Chung, F. R. K. (1988) Explicit construction of linear sized tolerant networks. Discrete Math. 72 15–19.
Alon, N. and Spencer, J. (2008) The Probabilistic Method, third edition, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley.
Boyd, S., Ghosh, A., Prabhakar, B. and Shah, D. (2006) Randomized gossip algorithms. IEEE Trans. Inform. Theory 52 2508–2530.
Broder, A. Z., Frieze, A. M., Suen, S. and Upfal, E. (1998) Optimal construction of edge-disjoint paths in random graphs. SIAM J. Comput. 28 541–573.
Chierichetti, F., Lattanzi, S. and Panconesi, A. (2010) Almost tight bounds for rumour spreading with conductance. In 42nd Annual ACM Symposium on Theory of Computing: STOC'10, pp. 399–408.
Cooper, C. and Frieze, A. M. (2007) The cover time of sparse random graphs. Random Struct. Alg. 30 1–16.
Doerr, B., Friedrich, T. and Sauerwald, T. (2008) Quasirandom rumor spreading. In 19th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA'08, pp. 773–781. arXiv.1012.5351
Dubhashi, D. and Panconesi, A. (2009) Concentration of Measure for the Analysis of Randomized Algorithms, Cambridge University Press.
Elsässer, R. and Sauerwald, T. (2009) On the runtime and robustness of randomized broadcasting. Theoret. Comput. Sci. 410 3414–3427.
Elsässer, R. and Sauerwald, T. (2009) Cover time and broadcast time. In 26th International Symposium on Theoretical Aspects of Computer Science: STACS'09, pp. 373–384.
Feige, U., Peleg, D., Raghavan, P. and Upfal, E. (1990) Randomized broadcast in networks. Random Struct. Alg. 1 447–460.
Fountoulakis, N. and Panagiotou, K. (2010) Rumor spreading on random regular graphs and expanders. In 14th International Workshop on Randomization and Computation: RANDOM'10, pp. 560–573.
Fountoulakis, N., Huber, A. and Panagiotou, K. (2010) Reliable broadcasting in random networks and the effect of density. In 29th IEEE Conference on Computer Communications: INFOCOM'10, pp. 2552–2560.
Friedrich, T., Gairing, M. and Sauerwald, T. (2012) Quasirandom load balancing. SIAM J. Comput. 41 747–771.
Frieze, A. and Grimmett, G. (1985) The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10 57–77.
Füredi, Z. and Kómlos, J. (1981) The eigenvalues of random symmetric matrices. Combinatorica 3 233–241.
Giakkoupis, G. (2011) Tight upper bounds for rumor spreading in graphs of a given conductance. In 28th International Symposium on Theoretical Aspects of Computer Science: STACS'11, pp. 57–68.
Giakkoupis, G. and Sauerwald, T. (2012) Rumor spreading and vertex expansion. In 23rd Annual ACM-SIAM Symposium on Discrete Algorithms: SODA'12,, pp. 1623–1641.
Hoory, S., Linial, N. and Wigderson, A. (2006) Expander graphs and their applications. Bull. Amer. Math. Soc. 43 439–561.
Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley.
Karp, R., Schindelhauer, C., Shenker, S. and Vöcking, B. (2000) Randomized rumor spreading. In 41st Annual IEEE Symposium on Foundations of Computer Science: FOCS'00, pp. 565–574.
Krivelevich, M. and Sudakov, B. (2006) Pseudo-random graphs. In More Sets, Graphs and Numbers, Vol. 15 of Bolyai Society Mathematical Studies, Springer, pp. 199–262.
McDiarmid, C. (1989) On the method of bounded differences. In Surveys in Combinatorics, Vol. 141 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 148–188.
Mitzenmacher, M. and Upfal, E. (2005) Probability and Computing: Randomized Algorithms and Probabilistic Analysis, Cambridge University Press.
Mosk-Aoyama, D. and Shah, D. (2008) Fast distributed algorithms for computing separable functions. IEEE Trans. Inform. Theory 54 2997–3007.
Vu, V. H. (2007) Spectral norm of random matrices. Combinatorica 27 721–736.