ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
A princess swimming in the fog looking for a monster cow
Full text PdfPdf (121 KB)
Source ACM SIGACT News archive
Volume 35 ,  Issue 2  (June 2004) table of contents
COLUMN: Online algorithms table of contents
Pages: 74 - 78  
Year of Publication: 2004
ISSN:0163-5700
Author
Marek Chrobak  University of California, Riverside
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 2
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/992287.992304
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Steve Alpern and Shmuel Gal. The Theory of Search Games and Rendezvous. Kluwer, 2003.
 
2
Ricardo A. Baeza-Yates , Joseph C. Culberson , Gregory J. E. Rawlins, Searching in the plane, Information and Computation, v.106 n.2, p.234-252, Oct. 1993  [doi>10.1006/inco.1993.1054]
 
3
V. J. Baston. Two rendezvous search problems on the line. Naval Research Logistics, 46:335--340, 1999.
 
4
R. Bellman. An optimal search problem. SIAM Review, 5:274, 1963.
 
5
R. Bellman. On the linear search problem. Naval Research Logistics Quarterly, 2:221--228, 1964.
 
6
Shmuel Gal. Search Games. Academic Press, 1980.
 
7
J. R. Isbell. An optimal search pattern. Naval Research Logistics Quarterly, 4:357--358, 1957.
 
8
Ming-Yang Kao , John H. Reif , Stephen 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, p.441-447, January 25-27, 1993, Austin, Texas, United States
 
9
Christos H. Papadimitriou , Mihalis Yannakakis, Shortest paths without a map, Theoretical Computer Science, v.84 n.1, p.127-150, July 22, 1991  [doi>10.1016/0304-3975(91)90263-2]

CITED BY  2
Marek Chrobak, SIGACT news online algorithms column 13: 2007 - an offine perspective, ACM SIGACT News, v.39 n.3, September 2008
Artur Jeż , Jakub Łopuszański, On the two-dimensional cow search problem, Information Processing Letters, v.109 n.11, p.543-547, May, 2009
Collaborative Colleagues:
Marek Chrobak: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player