E. J. Anderson and M. A. Aramendia, The search game on a network with immobile hider, Networks, vol.149, issue.7, pp.817-844, 1990.
DOI : 10.1002/net.3230200703

R. Baeza-yates, J. Culberson, and G. Rawlins, Searching in the Plane, Information and Computation, vol.106, issue.2, pp.234-244, 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

A. Beck and D. J. Newman, Yet more on the linear search problem, Israel Journal of Mathematics, vol.7, issue.4
DOI : 10.1007/BF02798690

R. Bellman, An Optimal Search, SIAM Review, vol.5, issue.3, p.274, 1963.
DOI : 10.1137/1005070

P. Bose, J. D. Carufel, and S. Durocher, Searching on a line: A complete characterization of the optimal solution, Theoretical Computer Science, vol.569, pp.24-42, 2015.
DOI : 10.1016/j.tcs.2014.12.007

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

URL : http://doi.org/10.1016/j.tcs.2006.05.018

S. Gal, Minimax Solutions for Linear Search Problems, SIAM Journal on Applied Mathematics, vol.27, issue.1, pp.17-30, 1974.
DOI : 10.1137/0127002

R. L. Smith, H. E. Romeijn, and J. Bean, Duality in infinite dimensional linear programming, Mathematical Programming, pp.79-97, 1992.

P. Jaillet and M. Stafford, Online Searching, Operations Research, vol.49, issue.4, pp.234-244, 1993.
DOI : 10.1287/opre.49.4.501.11227

M. Kao and M. L. Littman, Algorithms for informed cows, Proceedings of the AAAI 1997 Workshop on Online Search, 1997.

M. Kao, Y. Ma, M. Sipser, and Y. L. Yin, Optimal Constructions of Hybrid Algorithms, Journal of Algorithms, vol.29, issue.1, pp.142-164, 1998.
DOI : 10.1006/jagm.1998.0959

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
DOI : 10.1006/inco.1996.0092

D. F. Karney, Duality gaps in semi-infinite linear programming???an approximation problem, Mathematical Programming, vol.12, issue.1, pp.129-143, 1981.
DOI : 10.1007/BF01589340

D. G. Kirkpatrick, Hyperbolic Dovetailing, Proceedings of the 17th Annual European Symposium on Algorithms (ESA), pp.616-627, 2009.
DOI : 10.1007/978-3-642-04128-0_46

A. López-ortiz and S. Schuierer, The ultimate strategy to search on m rays? Theoretical Computer Science, pp.267-295, 2001.

A. López-ortiz and S. Schuierer, On-line parallel heuristics, processor scheduling and robot searching under the competitive framework, Theoretical Computer Science, vol.310, issue.1-3
DOI : 10.1016/j.tcs.2003.08.001

A. Mcgregor, K. Onak, and R. Panigrahy, The Oil Searching Problem
DOI : 10.1007/978-3-642-04128-0_45

S. Schuierer, A Lower Bound for Randomized Searching on m Rays, Computer Science in Perspective, pp.264-277, 2003.
DOI : 10.1007/3-540-36477-3_20