C. Noga-alon, M. Avin, G. Koucky, Z. Kozma, M. R. Lotker et al., Many Random Walks Are Faster Than One, Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, SPAA '08, pp.119-128, 2008.

S. Alpern, R. Fokkink, L. Gasieniec, R. Lindelauf, and V. S. Subrahmanian, Search theory: A game theoretic perspective, 2013.
DOI : 10.1007/978-1-4614-6825-7

S. Alpern and S. Gal, The theory of search games and rendezvous, International Series in Operations Research & Management Science, 2003.

R. A. Baezayates, J. C. Culberson, and G. J. Rawlins, Searching in the Plane, Information and Computation, vol.106, issue.2, pp.234-252, 1993.
DOI : 10.1006/inco.1993.1054

A. Beck, On the linear search problem, Israel Journal of Mathematics, vol.2, issue.4, pp.221-228, 1964.
DOI : 10.1007/BF02759737

D. Blackwell, Notes on dynamic programming. Unpublished notes, 1962.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.4800

J. Czyzowicz, E. Kranakis, D. Krizanc, L. Narayanan, and J. Opatrny, Search on a line with faulty robots, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, pp.405-414, 2016.
DOI : 10.1007/s00446-017-0296-0

J. Czyzowicz, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny et al., Linear Search with Terrain-Dependent Speeds, 1701.
DOI : 10.1007/978-3-319-19662-6_13

S. Das, Mobile agents in distributed computing: Network exploration, Bulletin of the European Association for Theoretical Computer Science (EATCS), issue.109, pp.54-69, 2013.

A. David and Z. Shmuel, Optimal sequential search: A bayesian approach. The Annals of Statistics, pp.1213-1221, 1985.

K. Efremenko and O. Reingold, How Well Do Random Walks Parallelize?, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 12th International Workshop, AP- PROX 2009, and 13th International Workshop, RANDOM 2009 Proceedings, pp.476-489, 2009.
DOI : 10.1007/978-3-642-03685-9_36
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.8780

R. Elsässer 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

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

O. Feinerman, A. Korman, Z. Lotker, and J. 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

P. Flocchini, G. Prencipe, and N. Santoro, Distributed Computing by Oblivious Mobile Robots, Synthesis Lectures on Distributed Computing Theory, vol.3, issue.2, 2012.
DOI : 10.2200/S00440ED1V01Y201208DCT010

P. Fraigniaud, A. Korman, and Y. Rodeh, Parallel exhaustive search without coordination, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, pp.312-323, 2016.
DOI : 10.1145/2897518.2897541
URL : https://hal.archives-ouvertes.fr/hal-01393646

M. Kao, J. H. Reif, and S. R. Tate, Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '93, pp.441-447, 1993.
DOI : 10.1006/inco.1996.0092

C. Milton and C. , A sequential search procedure. The Annals of Mathematical Statistics, pp.494-502, 1967.

G. Prencipe, Autonomous mobile robots: A distributed computing perspective Algorithms for Sensor Systems -9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS, vol.2013, pp.6-21, 2013.

L. Stone and D. , Theory of optimal search, Topics in Operations Research Series, 2001.