N. Alon, C. Avin, M. Kouck´ykouck´y, G. Kozma, Z. Lotker et al., Many Random Walks Are Faster Than One, Combinatorics, Probability and Computing, vol.47, issue.04, pp.481-502, 2011.
DOI : 10.1017/S0963548398003538

R. A. Baeza-yates, J. C. Culberson, and G. J. Rawlins, Searching in The Plane, Information and Computation, issue.1062, pp.234-252, 1991.

C. Cooper, A. M. Frieze, and T. Radzik, Multiple Random Walks in Random Regular Graphs, SIAM Journal on Discrete Mathematics, vol.23, issue.4, pp.1738-1761, 2009.
DOI : 10.1137/080729542

E. D. Demaine, S. P. Fekete, and S. Gal, Online searching with turn cost, Theoretical Computer Science, vol.361, issue.2-3, pp.342-355, 2006.
DOI : 10.1016/j.tcs.2006.05.018

R. Elsasser and T. Sauerwald, Tight bounds for the cover time of multiple random walks, Theoretical Computer Science, vol.412, issue.24, pp.2623-2641, 2011.
DOI : 10.1016/j.tcs.2010.08.010

E. Dibenedetto, Real analysis Birkhuser Advanced Texts: Basler Lehrbcher

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, 2014.
DOI : 10.1007/978-3-662-43951-7_40

O. Feinerman and A. Korman, Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology, Proc. 26th International Symposium on Distributed Computing (DISC), pp.61-75, 2012.
DOI : 10.1007/978-3-642-33651-5_5

O. Feinerman, A. Korman, Z. Lotker, and J. S. Sereni, Collaborative search on the plane without communication, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.77-86, 2012.
DOI : 10.1145/2332432.2332444

URL : https://hal.archives-ouvertes.fr/hal-01241094

H. Finner, A Generalization of Holder's Inequality and Some Probability Inequalities, The Annals of Probability, vol.20, issue.4, pp.1893-1901, 1992.
DOI : 10.1214/aop/1176989534

J. Jájá, Introduction to Parallel Algorithms, 1992.

M. Kao, J. H. Reif, and S. R. Tate, Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem, Information and Computation, vol.131, issue.1, pp.63-79, 1996.
DOI : 10.1006/inco.1996.0092

R. M. Karp, M. Saks, and A. Wigderson, On a search problem related to branch-and-bound procedures, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
DOI : 10.1109/SFCS.1986.34

F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, 1992.

C. Lenzen, N. A. Lynch, C. Newport, and T. Radeva, Trade-offs between selection complexity and performance when searching the plane without communication, Proceedings of the 2014 ACM symposium on Principles of distributed computing, PODC '14
DOI : 10.1145/2611462.2611463