How to explore a fast-changing world, Proc. of 35th ICALP, pp.121-132, 2008. ,
Balanced Allocations, SIAM Journal on Computing, vol.29, issue.1, pp.180-200, 1999. ,
DOI : 10.1137/S0097539795288490
Parsimonious flooding in dynamic graphs, Distributed Computing, vol.47, issue.6, pp.31-44, 2011. ,
DOI : 10.1007/s00446-011-0133-9
Random Graphs, 2001. ,
Gossip algorithms: design, analysis and applications, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., pp.1653-1664, 2005. ,
DOI : 10.1109/INFCOM.2005.1498447
Rumor Spreading in Social Networks, Proc. of 36th ICALP, pp.375-386, 2009. ,
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
Rumour spreading and graph conductance, Proc. of 21th ACM-SIAM SODA, pp.1657-1663, 2010. ,
DOI : 10.1137/1.9781611973075.135
Rumor spreading in random evolving graphs, Proc. of 21st ESA, pp.325-336, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00922696
Flooding Time of Edge-Markovian Evolving Graphs, SIAM Journal on Discrete Mathematics, vol.24, issue.4, pp.1694-1712, 2008. ,
DOI : 10.1137/090756053
Broadcasting in dynamic radio networks, Journal of Computer and System Sciences, vol.75, issue.4, pp.213-230, 2009. ,
DOI : 10.1016/j.jcss.2008.10.004
Information Spreading in Stationary Markovian Evolving Graphs, IEEE IPDPS, pp.1425-1432, 2009. ,
DOI : 10.1109/TPDS.2011.33
Epidemic algorithms for replicated database maintenance, Proc. of 6th ACM PODC, pp.1-12, 1987. ,
Social networks spread rumors in sublogarithmic time, Proc. of 43rd ACM STOC, pp.21-30, 2011. ,
On Random Graphs, Publ. Math, vol.6, pp.290-297, 1959. ,
Randomized broadcast in networks, Random Structures and Algorithms, vol.47, issue.4, pp.447-460, 1990. ,
DOI : 10.1002/rsa.3240010406
On models and algorithms for dynamic communication networks: The case for evolving graphs, Proc. of 4th ALGOTEL, pp.155-161, 2002. ,
Reliable Broadcasting in Random Networks and the Effect of Density, 2010 Proceedings IEEE INFOCOM, pp.2552-2560, 2010. ,
DOI : 10.1109/INFCOM.2010.5462084
Rumor Spreading on Random Regular Graphs and Expanders, Proc. of 13th APPROX/RANDOM, pp.560-573, 2010. ,
DOI : 10.1007/978-3-642-15369-3_42
Ultra-Fast Rumor Spreading in Social Networks, Proc. of 23rd ACM-SIAM SODA, pp.1642-1660, 2012. ,
DOI : 10.1137/1.9781611973099.130
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
Tight bounds for rumor spreading in graphs of a given conductance, Proc. of 28th STACS, pp.57-68, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00573638
Rumor Spreading and Vertex Expansion, Proc. of 23rd ACM-SIAM SODA, pp.1623-1641, 2012. ,
DOI : 10.1137/1.9781611973099.129
Random Graphs, The Annals of Mathematical Statistics, vol.30, issue.4, pp.1141-1144, 1959. ,
DOI : 10.1214/aoms/1177706098
Evolving graphs: dynamical models, inverse problems and propagation, Proc. R. Soc. A, pp.753-770, 2010. ,
DOI : 10.1038/30918
Resource discovery in distributed networks, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing , PODC '99, pp.229-237, 1999. ,
DOI : 10.1145/301308.301362
Information Propagation Speed in Mobile and Delay Tolerant Networks, IEEE Transactions on Information Theory, vol.56, issue.10, pp.5001-5015, 2010. ,
DOI : 10.1109/TIT.2010.2059830
URL : https://hal.archives-ouvertes.fr/inria-00196956
Gossip-based peer sampling, ACM Transactions on Computer Systems, vol.25, issue.3, 2007. ,
DOI : 10.1145/1275517.1275520
Randomized rumor spreading, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.565-574, 2000. ,
DOI : 10.1109/SFCS.2000.892324
Gossiping in distributed systems, ACM SIGOPS Operating Systems Review, vol.41, issue.5, pp.2-7, 2007. ,
DOI : 10.1145/1317379.1317381
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
Dynamic networks, ACM SIGACT News, vol.42, issue.1, pp.82-96, 2011. ,
DOI : 10.1145/1959045.1959064
Rumor Spreading and Vertex Expansion on Regular Graphs, Proc. of 22nd ACM-SIAM SODA, pp.462-475, 2011. ,
DOI : 10.1137/1.9781611973082.37
A Gossip-Style Failure Detection Service, Proc. of Middleware, pp.55-70, 1998. ,
DOI : 10.1007/978-1-4471-1283-9_4
Hop limited flooding over dynamic networks, 2011 Proceedings IEEE INFOCOM, pp.685-693, 2011. ,
DOI : 10.1109/INFCOM.2011.5935249
Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs, IEEE Transactions on Communications, vol.59, issue.5, pp.1259-1263, 2011. ,
DOI : 10.1109/TCOMM.2011.020811.090163
URL : https://hal.archives-ouvertes.fr/hal-01151852