C. Avin, M. Kouck-`-kouck-`-y, and Z. Lotker, How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs), Proc. 35th ICALP, pp.121-132, 2008.
DOI : 10.1007/978-3-540-70575-8_11

H. Baumann, P. Crescenzi, and P. Fraigniaud, Parsimonious flooding in dynamic graphs, Distributed Computing, vol.47, issue.6, pp.31-44, 2011.
DOI : 10.1007/s00446-011-0133-9

K. Censor-hillel and H. Shachnai, Fast Information Spreading in Graphs with Large Weak Conductance, SIAM Journal on Computing, vol.41, issue.6, pp.1451-1465, 2012.
DOI : 10.1137/110845380

F. Chierichetti, S. Lattanzi, and A. Panconesi, Almost tight bounds for rumour spreading with conductance, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.399-408, 2010.
DOI : 10.1145/1806689.1806745

F. Chierichetti, S. Lattanzi, and A. Panconesi, Rumor spreading in social networks, Theoretical Computer Science, vol.412, issue.24, pp.2602-2610, 2011.
DOI : 10.1016/j.tcs.2010.11.001

A. E. Clementi, P. Crescenzi, C. Doerr, P. Fraigniaud, M. Isopi et al., Rumor spreading in random evolving graphs, Proc. 21st ESA, pp.325-336, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00922696

A. E. Clementi, A. Monti, F. Pasquale, and R. Silvestri, Information Spreading in Stationary Markovian Evolving Graphs, IEEE Transactions on Parallel and Distributed Systems, vol.22, issue.9, pp.1425-1432, 2011.
DOI : 10.1109/TPDS.2011.33

A. E. Clementi, R. Silvestri, and L. Trevisan, Information spreading in dynamic graphs, Proc. 31st PODC, pp.37-46, 2012.

B. Doerr, M. Fouz, and T. Friedrich, Social networks spread rumors in sublogarithmic time, Proc. 43rd STOC, pp.21-30, 2011.

C. Dutta, G. Pandurangan, R. Rajaraman, Z. Sun, and E. Viola, On the Complexity of Information Spreading in Dynamic Networks, Proc. 24th SODA, pp.717-736, 2013.
DOI : 10.1137/1.9781611973105.52

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

N. Fountoulakis, K. Panagiotou, and T. Sauerwald, Ultra-Fast Rumor Spreading in Social Networks, Proc. 23rd SODA, pp.1642-1660, 2012.
DOI : 10.1137/1.9781611973099.130

C. Georgiou, S. Gilbert, R. Guerraoui, and D. R. Kowalski, Asynchronous gossip, Journal of the ACM, vol.60, issue.2, p.11, 2013.
DOI : 10.1145/2450142.2450147

G. Giakkoupis, Tight bounds for rumor spreading in graphs of a given conductance, Proc. 28th STACS, pp.57-68, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573638

G. Giakkoupis, Tight Bounds for Rumor Spreading with Vertex Expansion, Proc. 25th SODA, pp.801-815, 2014.
DOI : 10.1137/1.9781611973402.59
URL : https://hal.archives-ouvertes.fr/hal-01097140

G. Giakkoupis and T. Sauerwald, Rumor Spreading and Vertex Expansion, Proc. 23rd SODA, pp.1623-1641, 2012.
DOI : 10.1137/1.9781611973099.129
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.8395

B. Haeupler and D. R. Karger, Faster information dissemination in dynamic networks via network coding, Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '11, pp.381-390, 2011.
DOI : 10.1145/1993806.1993885

B. Haeupler and F. Kuhn, Lower Bounds on Information Dissemination in Dynamic Networks, Proc. 26th DISC, pp.166-180, 2012.
DOI : 10.1007/978-3-642-33651-5_12

R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, Randomized rumor spreading, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.565-574, 2000.
DOI : 10.1109/SFCS.2000.892324
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.6813

H. Kesten and V. Sidoravicius, The spread of a rumor or infection in a moving population, The Annals of Probability, vol.33, issue.6, pp.2402-2462, 2005.
DOI : 10.1214/009117905000000413

F. Kuhn, N. Lynch, and R. Oshman, Distributed computation in dynamic networks, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.513-522, 2010.
DOI : 10.1145/1806689.1806760

H. Lam, Z. Liu, M. Mitzenmacher, X. Sun, and Y. Wang, -Dimensional Space, Proc. 23rd SODA, pp.1612-1622, 2012.
DOI : 10.1137/1.9781611973099.128
URL : https://hal.archives-ouvertes.fr/in2p3-00608705

J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, Statistical properties of community structure in large social and information networks, Proceeding of the 17th international conference on World Wide Web , WWW '08, pp.695-704, 2008.
DOI : 10.1145/1367497.1367591

D. Mosk-aoyama and D. Shah, Fast Distributed Algorithms for Computing Separable Functions, IEEE Transactions on Information Theory, vol.54, issue.7, pp.2997-3007, 2008.
DOI : 10.1109/TIT.2008.924648

Y. Peres, A. Sinclair, P. Sousi, and A. Stauffer, Mobile geometric graphs: Detection, coverage and percolation, Proc. 22nd SODA, pp.412-428, 2011.
DOI : 10.1007/s00440-012-0428-1
URL : http://arxiv.org/abs/1008.0075

A. Pettarin, A. Pietracaprina, G. Pucci, and E. Upfal, Tight bounds on information dissemination in sparse mobile networks, Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '11, pp.355-362, 2011.
DOI : 10.1145/1993806.1993882

A. D. Sarma, A. R. Molla, and G. Pandurangan, Fast distributed computation in dynamic networks via random walks, Proc. 26th DISC, pp.136-150, 2012.

T. Sauerwald and A. Stauffer, Rumor Spreading and Vertex Expansion on Regular Graphs, Proc. 22nd SODA, pp.462-475, 2011.
DOI : 10.1137/1.9781611973082.37