Amortized efficiency of list update and paging rules
Communications of the ACM
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Competitive algorithms for server problems
Journal of Algorithms
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Lower bounds for randomized k-server and motion-planning algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Information and Computation
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Map-Free Localisation in a Partially Moving 3D World: the Edinburgh Feature-Based Navigator
Intelligent Autonomous Systems 2, An International Conference
Infinite games: randomization, computability, and applications to online problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Piecemeal learning of an unknown environment
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Competitive searching in a generalized street
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Piecemeal graph exploration by a mobile robot (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Optimal robot localization in trees
Proceedings of the twelfth annual symposium on Computational geometry
Robot navigation with range queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Localizing a robot with minimum travel
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
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
On-line search in a simple polygon
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimal constructions of hybrid algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal constrained graph exploration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Spanning-tree based coverage of continuous areas by a mobile robot
Annals of Mathematics and Artificial Intelligence
Exploring an Unknown Polygonal Environment with Bounded Visibility
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Searching Rectilinear Streets Completely
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Robot Map Verification of a Graph World
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
An Online Algorithm for the Postman Problem with a Small Penalty
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Searching and on-line recognition of star-shaped polygons
Information and Computation
On-line path planning in an unknown polygonal environment
Information Sciences—Informatics and Computer Science: An International Journal
Application of automata learning algorithms to robot motion tracking
ISPRA'05 Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation
Multi-robot tree and graph exploration
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
An optimal strategy for searching in unknown streets
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Efficient goal-directed exploration
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Intensity-based navigation with global guarantees
Autonomous Robots
| Hi-index | 0.00 |