Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for server problems
Journal of Algorithms
Shortest watchman routes in simple polygons
Discrete & Computational Geometry
Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Theoretical Computer Science
How to learn an unknown environment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Walking an unknown street with bounded detour
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Information and Computation
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Competitive searching in a generalized street
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Searching for the kernel of a polygon—a competitive strategy
Proceedings of the eleventh annual symposium on Computational geometry
New competitive strategies for searching in unknown star-shaped polygons
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Position-independent near optimal searching and on-line recognition in star polygons
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Localizing a robot with minimum travel
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A competitive strategy for learning a polygon
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Multi-robot collaboration for robust exploration
Annals of Mathematics and Artificial Intelligence
Improved exploration of rectilinear polygons
Nordic Journal of Computing
Exploring an Unknown Polygonal Environment with Bounded Visibility
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Online Parallel Heuristics and Robot Searching under the Competitive Framework
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Position-Independent Street Searching
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Searching Rectilinear Streets Completely
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A lower bound for randomized searching on m rays
Computer Science in Perspective
Searching and on-line recognition of star-shaped polygons
Information and Computation
Theoretical Computer Science
On-line path planning in an unknown polygonal environment
Information Sciences—Informatics and Computer Science: An International Journal
Competitive exploration of rectilinear polygons
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Extending the Path-Planning Horizon
International Journal of Robotics Research
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Polygon exploration with time-discrete vision
Computational Geometry: Theory and Applications
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Information Processing Letters
An optimal competitive strategy for walking in streets
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
An optimal strategy for searching in unknown streets
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Optimality and competitiveness of exploring polygons by mobile robots
Information and Computation
Computational Geometry: Theory and Applications
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
| Hi-index | 0.01 |