B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.230-240, 1987.
DOI : 10.1145/28395.28421

B. Awerbuch and R. G. Gallager, Distributed BFS algorithms, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.250-256, 1985.
DOI : 10.1109/SFCS.1985.20

B. Awerbuch and R. G. Gallager, A new distributed algorithm to find breadth first search trees, IEEE Transactions on Information Theory, vol.33, issue.3, pp.315-322, 1987.
DOI : 10.1109/TIT.1987.1057314

B. Awerbuch, O. Goldreich, R. Vainish, and D. Peleg, A trade-off between information and communication in broadcast protocols, Journal of the ACM, vol.37, issue.2, pp.238-256, 1990.
DOI : 10.1145/77600.77618

B. Awerbuch, I. Cidon, and S. Kutten, Optimal maintenance of a spanning tree, Journal of the ACM, vol.55, issue.4, pp.1-18
DOI : 10.1145/1391289.1391292

M. Bienkowski, L. Gasieniec, M. Klonowski, M. Korzeniowski, and S. Schmid, Event Extent Estimation, Proceedings of the 17th international conference on Structural Information and Communication Complexity, SIROCCO'10, pp.57-71978, 2010.
DOI : 10.1007/978-3-642-13284-1_6

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.5789

S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomized gossip algorithms, IEEE Transactions on Information Theory, vol.52, issue.6, pp.2508-2530, 2006.
DOI : 10.1109/TIT.2006.874516

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.8625

B. S. Chlebus and D. R. Kowalski, Robust gossiping with an application to consensus, Journal of Computer and System Sciences, vol.72, issue.8, pp.1262-1281, 2006.
DOI : 10.1016/j.jcss.2006.08.001

M. Chrobak, L. Ga¸sieniec, and D. R. Kowalski, The Wake???Up Problem in MultiHop Radio Networks, SIAM Journal on Computing, vol.36, issue.5, pp.1453-1471, 2006.
DOI : 10.1137/S0097539704442726

A. E. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, SODA '01, pp.709-718, 2001.

A. Demers, D. Greene, C. Houser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database maintenance, ACM SIGOPS Operating Systems Review, vol.22, issue.1, pp.8-32, 1988.
DOI : 10.1145/43921.43922

S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, vol.3, issue.4, pp.319-349, 1988.
DOI : 10.1002/net.3230180406

J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger, Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series), 2005.

D. Kempe, J. Kleinberg, and A. Demers, Spatial gossip and resource location protocols, Journal of the ACM, vol.51, issue.6, pp.943-967, 2004.
DOI : 10.1145/1039488.1039491

E. Korach, S. Moran, and S. Zaks, Optimal lower bounds for some distributed algorithms for a complete network of processors, Theoretical Computer Science, vol.64, issue.1, pp.125-1320304, 1989.
DOI : 10.1016/0304-3975(89)90103-5

A. Pelc, ISSN 1097-0037. doi: 10.1002/(SICI), 3<143::AID-NET3>3.0.CO, pp.143-1561097, 1996.

D. Peleg, Distributed computing: a locality-sensitive approach, Society for Industrial and Applied Mathematics, 2000.
DOI : 10.1137/1.9780898719772