Skip to main content
SpringerLink
Log in

Deterministic Searching on the Line

1988; Baeza-Yates, Culberson, Rawlins

  • Reference work entry
Book cover Encyclopedia of Algorithms

  • 244 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Alpern, S., Gal, S.: The Theory of Search Games and Rendevouz. Kluwer Academic Publishers, Dordrecht (2003)

    Google Scholar 

  2. Baeza-Yates, R., Culberson, J., Rawlins, G.: Searching in the Plane. Inf. Comput. 106(2), 234–252 (1993) Preliminary version as Searching with uncertainty. In: Karlsson, R., Lingas, A. (eds.) Proceedings SWAT 88, First Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 318, pp. 176–189. Halmstad, Sweden (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baeza-Yates, R., Schott, R.: Parallel searching in the plane. Comput. Geom. Theor. Appl. 5, 143–154 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blum, A., Raghavan, P., Schieber, B.: Navigating in Unfamiliar Geometric Terrain. In: On Line Algorithms, pp. 151–155, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence RI (1992) Preliminary Version in STOC 1991, pp. 494–504

    Google Scholar 

  5. Demaine, E., Fekete, S., Gal, S.: Online searching with turn cost. Theor. Comput. Sci. 361, 342–355 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gal, S.: Minimax solutions for linear search problems. SIAM J. Appl. Math. 27, 17–30 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gal, S.: Search Games, pp. 109–115, 137–151, 189–195. Academic Press, New York (1980)

    Google Scholar 

  8. Hipke, C., Icking, C., Klein, R., Langetepe, E.: How to Find a point on a line within a Fixed distance. Discret. Appl. Math. 93, 67–73 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kao, M.-Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. Inf. Comput. 131(1), 63–79 (1996) Preliminary version in SODA '93, pp. 441–447

    Article  MathSciNet  MATH  Google Scholar 

  10. Lopez-Ortiz, A.: On-Line Target Searching in Bounded and Unbounded Domains: Ph. D. Thesis, Technical Report CS-96-25, Dept. of Computer Sci., Univ. of Waterloo (1996)

    Google Scholar 

  11. Lopez-Ortiz, A., Schuierer, S.: The Ultimate Strategy to Search on m Rays? Theor. Comput. Sci. 261(2), 267–295 (2001)

    MathSciNet  MATH  Google Scholar 

  12. Papadimitriou, C.H., Yannakakis, M.: Shortest Paths without a Map. Theor. Comput. Sci. 84, 127–150 (1991) Preliminary version in ICALP '89

    Article  MathSciNet  MATH  Google Scholar 

  13. Schuierer, S.: Lower bounds in on-line geometric searching. Comput. Geom. 18, 37–53 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Chile, Santiago, Chile

    Ricardo Baeza-Yates

Authors
  1. Ricardo Baeza-Yates
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Baeza-Yates, R. (2008). Deterministic Searching on the Line. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_106

Download citation

Publish with us

Policies and ethics

Search

Navigation