Craig A. Tovey

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Apurva Mudgal

> Home > Persons > Craig A. Tovey

Publications

2009
[j35]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/KoenigMMT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/KoenigMMT09
Sven Koenig, Joseph S. B. Mitchell, Apurva Mudgal, Craig A. Tovey:
A Near-Tight Approximation Algorithm for the Robot Localization Problem. SIAM J. Comput. 39(2): 461-490 (2009)
2006
[c11]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/KoenigMT06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/KoenigMT06
Sven Koenig, Apurva Mudgal, Craig A. Tovey:
A near-tight approximation lower bound and algorithm for the kidnapped robot problem. SODA 2006: 133-142
2005
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/MudgalTGK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/MudgalTGK05
Apurva Mudgal, Craig A. Tovey, Sam Greenberg, Sven Koenig:
Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic. SIAM J. Discret. Math. 19(2): 431-447 (2005)
2004
[c9]
- view
  - electronic edition @ rutgers.edu (archived)
  - no references & citations available
- export record
  dblp key:
  - conf/isaim/MudgalTK04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaim/MudgalTK04
Apurva Mudgal, Craig A. Tovey, Sven Koenig:
Analysis of Greedy Robot-Navigation Methods. AI&M 2004

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.