Y. Afek, N. Alon, Z. Bar-joseph, A. Cornejo, B. Haeupler et al., Beeping a maximal independent set, Distributed Computing, vol.26, issue.4, pp.195-208, 2013.

Y. Afek, N. Alon, O. Barad, E. Hornstein, N. Barkai et al., , 2011.

D. Alistarh, J. Aspnes, D. Eisenstat, R. Gelashvili, and R. L. Rivest, Time-space tradeoffs in population protocols, SODA, pp.2560-2579, 2017.

D. Alistarh, J. Aspnes, and R. Gelashvili, Space-optimal majority in population protocols. SODA, pp.2221-2239, 2018.

N. Alon, M. Braverman, K. Efremenko, R. Gelles, and B. Haeupler, Reliable communication over highly connected noisy networks, pp.165-173, 2016.

F. Amor, P. Ortega, X. Cerdá, and R. Boulay, Cooperative prey-retrieving in the ant cataglyphis floricola: An unusual short-distance recruitment, Insectes Sociaux, vol.57, issue.1, 2010.

D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta, Computation in networks of passively mobile finite-state sensors. Distributed Computing, vol.18, pp.235-253, 2006.

D. Angluin, J. Aspnes, and D. Eisenstat, A simple population protocol for fast robust approximate majority, Distributed Computing, vol.21, issue.2, pp.87-102, 2008.

D. Angluin, J. Aspnes, M. J. Fischer, and H. Jiang, Self-stabilizing population protocols, TAAS, vol.3, issue.4, 2008.

D. Angluin, J. Aspnes, D. Eisenstat, and E. Ruppert, The computational power of population protocols, Distributed Computing, vol.20, issue.4, pp.279-304, 2007.

J. A. Aslam and A. Dhagat, Searching in the presence of linearly bounded errors, STOC, pp.486-493, 1991.

J. Aspnes and E. Ruppert, An introduction to population protocols, Bulletin of the EATCS, vol.93, pp.98-117, 2007.

H. Attiya, A. Herzberg, and S. Rajsbaum, Optimal clock synchronization under different delay assumptions, SIAM J. Comput, vol.25, issue.2, pp.369-389, 1996.

F. Bartumeus and J. Catalan, Optimal search behavior and classic foraging theory, Journal of Physics a-Mathematical and Theoretical, vol.42, 2009.

J. Beauquier, J. Burman, and S. Kutten, A self-stabilizing transformer for population protocols with covering, Theor. Comput. Sci, vol.412, issue.33, pp.4247-4259, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00531379

L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and G. Posta, Self-stabilizing repeated balls-into-bins. SPAA, pp.332-339, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02002632

L. Becchetti, A. E. Clementi, E. Natale, F. Pasquale, and R. Silvestri, Plurality consensus in the gossip model. SODA, pp.371-390, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02002629

L. Becchetti, A. E. Clementi, E. Natale, F. Pasquale, and L. Trevisan, Stabilizing consensus with many opinions. SODA, pp.620-635, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02002615

Y. Ben-asher, E. Farchi, and I. Newman, Optimal search in trees, SIAM J. Comput, vol.28, issue.6, pp.2090-2102, 1999.

M. Ben-or, D. Dolev, and E. N. Hoch, Fast self-stabilizing byzantine tolerant digital clock synchronization, pp.385-394, 2008.

M. Ben-or and A. Hassidim, The bayesian learner is optimal for noisy binary search (and pretty good for quantum as well, FOCS, pp.221-230, 2008.

W. Bialek, Physical limits to sensation and perception. Annual review of biophysics and biophysical chemistry, vol.16, pp.455-478, 1987.

L. Boczkowski, A. Korman, and E. Natale, Minimizing message size in stochastic communication patterns: Fast self-stabilizing protocols with 3 bits. SODA, pp.2540-2559, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01447435

L. Boczkowski, O. Feinerman, A. Korman, and E. Natale, Limits for rumor spreading in stochastic populations, ITCS, vol.49, pp.1-49, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01958152

L. Boczkowski, O. Feinerman, A. Korman, and E. Natale, Limits on reliable information flows through stochastic populations, PLOS Computational Biology, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01953778

L. Boczkowski, B. Guinard, A. Korman, Z. Lotker, and M. Renault, Random walks with multiple step lengths. LATIN, pp.174-186, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01955582

L. Boczkowski, I. Kerenidis, and F. Magniez, , vol.130, 2017.

L. Boczkowski, A. Korman, and U. Feige, Typically fast search on trees with permanently noisy advice. under submission

L. Boczkowski, A. Korman, and E. Natale, Minimizing message size in stochastic communication patterns: Fast self-stabilizing protocols with 3 bits. SODA, pp.2540-2559, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01447435

L. Boczkowski, A. Korman, and E. Natale, Minimizing message size in stochastic communication patterns: Fast self-stabilizing protocols with 3 bits. Distributed Computing, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01447435

L. Boczkowski, A. Korman, and Y. Rodeh, Searching a tree with permanently noisy advice, ESA, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01958133

R. S. Borgstrom and S. R. Kosaraju, Comparison-based search in the presence of errors, STOC, pp.130-136, 1993.

M. Braverman and E. Mossel, Noisy sorting without resampling. SODA, pp.268-276, 2008.

G. S. Brodal, R. Fagerberg, I. Finocchi, F. Grandoni, G. F. Italiano et al., Optimal resilient dynamic dictionaries. Algorithms-ESA, 15th Annual European Symposium, pp.347-358, 2007.

A. Cavagna, A. Cimarelli, I. Giardina, G. Parisi, R. Santagati et al., Scale-free correlations in starling flocks, PNAS, vol.107, issue.26, pp.11865-11870, 2010.

K. Censor-hillel, B. Haeupler, J. A. Kelner, and P. Maymounkov, Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance, STOC, pp.961-970, 2012.

E. Chastain, A. Livnat, C. Papadimitriou, and U. Vazirani, Algorithms, games, and evolution, vol.111, pp.10620-10623, 2014.

B. Chazelle, Natural algorithms. SODA, pp.422-431, 2009.

B. Chazelle, The convergence of bird flocking, J. ACM, vol.61, issue.4, 2014.

F. Chierichetti, S. Lattanzi, and A. Panconesi, Rumor spreading in social networks, ICALP, pp.375-386, 2009.

F. Cicalese and U. Vaccaro, Optimal strategies against a liar, Theor. Comput. Sci, vol.230, issue.1-2, pp.167-193, 2000.

C. Cooper, R. Elsässer, T. Radzik, N. Rivera, and T. Shiraga, Fast consensus for voting on general expander graphs. DISC, pp.248-262, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01206462

I. Couzin, J. Krause, N. Franks, and S. Levin, Effective leadership and decision making in animal groups on the move, Nature, vol.433, pp.513-516, 2005.

T. M. Cover and B. Gopinath, Open problems in communication and computation, 2012.

A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database maintenance, 1987.

E. W. Dijkstra, Self-stabilizing systems in spite of distributed control, Commun. ACM, vol.17, issue.11, pp.643-644, 1974.

B. Doerr and M. Fouz, Asymptotically optimal randomized rumor spreading. Electronic Notes in Discrete Mathematics, vol.38, pp.297-302, 2011.

B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, Stabilizing consensus with the power of two choices, SPAA, pp.149-158, 2011.

D. Dolev and E. N. Hoch, On self-stabilizing synchronous actions despite byzantine attacks. DISC, pp.193-207, 2007.

S. Dolev, Possible and impossible self-stabilizing digital clock synchronization in general graphs, Real-Time Systems, vol.12, issue.1, pp.95-107, 1997.

S. Dolev and J. L. Welch, Self-stabilizing clock synchronization in the presence of byzantine faults, J. ACM, vol.51, issue.5, pp.780-799, 2004.

A. Dornhaus and L. Chittka, Food alert in bumblebees (bombus terrestris): Possible mechanisms and evolutionary implications, Behavioral Ecology and Sociobiology, vol.50, issue.6, pp.570-576, 2001.

A. Drewitz and A. F. Ramiréz, Selected topics in random walk in random environment. Topics in Percolative and Disordered Systems, Springer Proceedings in Mathematics and Statistics, vol.69, pp.23-83, 2014.

B. Dudek and A. Kosowski, Universal protocols for information dissemination using emergent signals. STOC, pp.87-99, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01503359

R. Elsässer, T. Friedetzky, D. Kaaser, F. Mallmann-trenn, and H. Trinker, Efficient k-party voting with two choices, 2016.

R. Elsässer and T. Sauerwald, On the runtime and robustness of randomized broadcasting, Theor. Comput. Sci, vol.410, issue.36, pp.3414-3427, 2009.

E. Emamjomeh-zadeh, D. Kempe, and V. Singhal, Deterministic and probabilistic binary search in graphs, STOC, pp.519-532, 2016.

Y. Emek and R. Wattenhofer, Stone age distributed computing. PODC, pp.137-146, 2013.

Y. Emek, T. Langner, D. Stolz, J. Uitto, and R. Wattenhofer, How many ants does it take to find the food? SIROCCO, pp.263-278, 2014.

Y. Emek, T. Langner, J. Uitto, and R. Wattenhofer, Solving the ANTS problem with asynchronous finite state machines. ICALP, pp.471-482, 2014.

J. M. Emlen, The role of time and energy in food preference, The American Naturalist, vol.100, issue.916, pp.611-617, 1966.

U. Feige, P. Raghavan, D. Peleg, and E. Upfal, Computing with noisy information, SIAM J. Comput, vol.23, issue.5, pp.1001-1018, 1994.

O. Feinerman, B. Haeupler, and A. Korman, Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01672280

O. Feinerman and A. Korman, Theoretical distributed computing meets biology: A review. ICDCIT, pp.1-18, 2013.

O. Feinerman and A. Korman, Clock synchronization and estimation in highly dynamic networks: An information theoretic approach. SIROCCO, pp.16-30, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01240216

O. Feinerman and A. Korman, Individual versus collective cognition in social insects, Submitted to Journal of Experimental Biology, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01432718

O. Feinerman, A. Rotem, and E. Moses, Reliable neuronal logic devices from patterned hippocampal cultures, Nature physics, vol.4, issue.12, pp.967-973, 2008.

O. Feinerman and A. Korman, The ANTS problem. Distributed Computing, vol.30, pp.149-168, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01430372

I. Finocchi, F. Grandoni, and G. F. Italiano, Resilient search trees. SODA, pp.547-553, 2007.

I. Finocchi and G. F. Italiano, Sorting and searching in the presence of memory faults (without redundancy). STOC, pp.101-110, 2004.

E. Fonio, Y. Heyman, L. Boczkowski, A. Gelblum, A. Kosowski et al., A locally-blazed ant trail achieves efficient collective navigation despite limited information, eLife, vol.5, p.20185, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01413748

P. Fraigniaud and E. Natale, Noisy rumor spreading and plurality consensus. PODC, pp.127-136, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01423686

R. G. Gallager, Finding parity in a simple broadcast network, IEEE Trans. Inf. Theor, vol.34, issue.2, pp.176-180, 2006.

L. Gasieniec and G. Stachowiak, Fast space optimal leader election in population protocols. SODA, pp.2653-2667, 2018.

A. Gelblum, I. Pinkoviezky, E. Fonio, A. Ghosh, and O. Feinerman, Ant groups optimally amplify the effect of transiently informed individuals, Nature Communications, vol.6, p.7729, 2015.

L. A. Giraldeau, T. J. Valone, and J. Templeton, Potential disadvantages of using socially acquired information, Philosophical Transactions of the Royal Society of London B: Biological Sciences, vol.357, pp.1559-1566, 1427.

N. Goyal, G. Kindler, and M. E. Saks, Lower bounds for the noisy broadcast problem, SIAM J. Comput, vol.37, issue.6, pp.1806-1841, 2008.

R. H. Macarthur and E. R. Pianka, On optimal use of a patchy environment, The American Naturalist, vol.100, pp.603-609, 1966.

N. Hanusse, D. Ilcinkas, A. Kosowski, and N. Nisse, Locating a target with an agent guided by unreliable local advice: How to beat the random walk when you have a clock?, pp.355-364, 2010.

N. Hanusse, D. Kavvadias, E. Kranakis, and D. Krizanc, Memoryless search algorithms in a network with faulty advice, Theoretical Computer Science, vol.402, issue.2-3, pp.190-198, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00341468

N. Hanusse, E. Kranakis, and D. Krizanc, Searching with mobile agents in networks with liars, Discrete Applied Mathematics, vol.137, issue.1, pp.69-85, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00307259

A. Hassidim and Y. Singer, Submodular optimization under noise, pp.1069-1122, 2017.

T. Herman, Phase clocks for transient fault repair, IEEE Trans. Parallel Distrib. Syst, vol.11, issue.10, pp.1048-1057, 2000.

T. Higashino, Y. Katayama, T. Masuzawa, M. Potop-butucaru, and M. Yamashita, Lecture Notes in Computer Science, vol.8255, 2013.

B. Hölldobler, Recruitment behavior in camponotus socius (hym. formicidae), J. of Comparative Physiology A, vol.75, issue.2, pp.123-142, 1971.

B. Hölldobler and E. O. Wilson, The ants, 1990.

R. M. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, Randomized rumor spreading. FOCS, pp.565-574, 2000.

R. M. Karp and R. Kleinberg, Noisy binary search and its applications. SODA, pp.881-890, 2007.

D. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregate information, FOCS, pp.482-491, 2003.

A. Korman, E. Greenwald, and O. Feinerman, Confidence sharing: An economic strategy for efficient information flows in animal groups, PLoS Comp. Biology, vol.10, issue.10, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01093295

A. Kravchik and S. Kutten, Time optimal synchronous self stabilizing spanning tree, DISC, vol.8205, pp.91-105, 2013.

E. S. Laber and L. T. Nogueira, Fast searching in trees, Eletronic Notes on Discrete Mathematics, 2001.

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Commun. ACM, vol.21, issue.7, pp.558-565, 1978.

L. , L. Goff, and P. Soulier, Of ants and urns: estimation of the parameters of a reinforced random walk and application to ants behavior, 2014.

C. Lenzen, T. Locher, P. Sommer, and R. Wattenhofer, Clock synchronization: Open problems in theory and practice, SOFSEM, pp.61-70, 2010.

C. Lenzen, T. Locher, and R. Wattenhofer, Tight bounds for clock synchronization, J. ACM, vol.57, issue.2, 2010.

C. Lenzen and J. Rybicki, Efficient counting with optimal resilience. DISC, pp.16-30, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01199803

C. Lenzen, J. Rybicki, and J. Suomela, Towards optimal synchronous counting. PODC, pp.441-450, 2015.

S. Marras, R. Batty, and P. Domenici, Information transfer and antipredator maneuvers in schooling herring, Adaptive Behavior, vol.20, issue.1, pp.44-56, 2012.

C. Mcdiarmid, Concentration, pp.195-248, 1998.

S. Mozes, K. Onak, and O. Weimann, Finding an optimal tree searching strategy in linear time, SODA, pp.1096-1105, 2008.

C. Musco, H. Su, and N. A. Lynch, Ant-inspired density estimation via random walks: Extended abstract, pp.469-478, 2016.

K. Onak and P. Parys, Generalization of binary search: Searching in trees and forest-like partial orders, FOCS, pp.379-388, 2006.

A. Pelc, Searching games with errors-fifty years of coping with liars, Theor. Comput. Sci, vol.270, issue.1-2, pp.71-109, 2002.

B. Pittel, On spreading a rumor, SIAM J. Appl. Math, vol.47, issue.1, pp.213-223, 1987.

N. Razin, J. Eckmann, and O. Feinerman, Desert ants achieve reliable recruitment across noisy interactions, Journal of the Royal Society Interface, vol.10, 2013.

G. Rieucau and L. A. Giraldeau, Persuasive companions can be wrong: the use of misleading social information in nutmeg mannikins, Behavioral Ecology, pp.1217-1222, 2009.

P. Rigollet, High dimensional statistics. Lecture notes for course 18S997, 2015.

G. Roberts, Why individual vigilance increases as group size increases, Animal Behaviour, vol.51, pp.1077-1086, 1996.

S. B. Rosenthal, C. R. Twomey, A. T. Hartnett, H. S. Wu, and I. D. Couzin, Revealing the hidden networks of interaction in mobile animal groups allows prediction of complex behavioral contagion, PNAS, vol.112, issue.15, pp.4690-4695, 2015.

S. Shah, R. Kothari, J. Dr, and S. Chandra, Trail formation in ants. a generalized polya urn process, Swarm Intelligence, vol.4, pp.145-171, 2010.

A. Snitzman, Topics in random walks in random environment, ICTP Lecture Notes Series, 2004.

D. J. Sumpter, J. Krause, R. James, I. D. Couzin, and A. J. Ward, Consensus decision making by fish, Current biology, vol.18, issue.22, pp.1773-1777, 2008.

J. J. Templeton and G. L. , Patch assessment in foraging flocks of european starlings: evidence for the use of public information, Behavioral Ecology, vol.6, issue.1, pp.65-72, 1995.

J. Von-neumann, Probabilistic logics and the synthesis of reliable organisms from unreliable components, Automata Studies, pp.43-98, 1956.

A. Xu and M. Raginsky, Information-theoretic lower bounds for distributed function computation, IEEE Trans. Information Theory, vol.63, issue.4, pp.2314-2337, 2017.