How to Explore a Fast-Changing World Controlled flooding search in a large network, 35th International Colloquium on Automata, Languages and Programming (ICALP), pp.121-132436, 2007. ,
Information survival threshold in sensor and P2P networks, 26th IEEE INFOCOM, pp.1316-1324, 2007. ,
Flooding time in edge-Markovian dynamic graphs, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.213-222, 2008. ,
DOI : 10.1145/1400751.1400781
Communication in dynamic radio networks, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.205-214, 2007. ,
DOI : 10.1145/1281100.1281131
Information Spreading in Stationary Markovian Evolving Graphs, 23rd IEEE Int. Parallel and Dist. Processing Symp. (IPDPS) ,
Thresholds for virus spread on networks, The Annals of Applied Probability, vol.18, issue.2, pp.359-378, 2008. ,
DOI : 10.1214/07-AAP470
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
Randomized broadcast in networks, Int. Symposium on Algorithms (SIGAL), pp.128-137, 1990. ,
DOI : 10.1002/rsa.3240010406
Mobility increases the capacity of ad hoc wireless networks, IEEE/ACM Transactions on Networking, vol.10, issue.4, pp.477-486, 2002. ,
DOI : 10.1109/TNET.2002.801403
Protocols and impossibility results for gossip-based communication mechanisms, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.471-480, 2002. ,
DOI : 10.1109/SFCS.2002.1181971
Spatial gossip and resource location protocols, 33rd ACM Symposium on Theory of Computing (STOC), pp.163-172, 2001. ,
Search and replication in unstructured peer-to-peer networks, 16th ACM Int. Conference on Supercomputing (ICS), pp.84-95, 2002. ,
On spreading a rumour, SIAM J. Applied Math, vol.47, pp.213-223, 1987. ,
The Impact of Mobility on Gossip Algorithms, 28th Conference on Computer Communications (INFOCOM), 2009. ,