Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Competitive searching in a generalized street
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Optimal robot localization in trees
Proceedings of the twelfth 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
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Asymmetric rendezvous on the plane
Proceedings of the fourteenth annual symposium on Computational geometry
On-line choice of on-line algorithms
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
An improved approximation ratio for the minimum latency problem
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
On-line single-server dial-a-ride problems
Theoretical Computer Science
Optimal robot localization in trees
Information and Computation
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
The power of a pebble: exploring and mapping directed graphs
Information and Computation
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
Robot Map Verification of a Graph World
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Locating Information with Uncertainty in Fully Interconnected Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Online Routing in Triangulations
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Searching with Mobile Agents in Networks with Liars
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
The Ultimate Strategy to Search on m Rays?
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Robotic Exploration, Brownian Motion and Electrical Resistance
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Scheduling contract algorithms on multiple processors
Eighteenth national conference on Artificial intelligence
Combining online algorithms for rejection and acceptance
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Optimal Sequencing of Contract Algorithms
Annals of Mathematics and Artificial Intelligence
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
A princess swimming in the fog looking for a monster cow
ACM SIGACT News
Journal of Scheduling
On-line path planning in an unknown polygonal environment
Information Sciences—Informatics and Computer Science: An International Journal
Competitive online routing in geometric graphs
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
A near-tight approximation lower bound and algorithm for the kidnapped robot problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Scheduling search procedures: The wheel of fortune
Journal of Scheduling
Online searching with turn cost
Theoretical Computer Science - Approximation and online algorithms
Theoretical Computer Science
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
International Journal of Robotics Research
Ranking hypotheses to minimize the search cost in probabilistic inference models
Discrete Applied Mathematics
Classifying the multi robot path finding problem into a quadratic competitive complexity class
Annals of Mathematics and Artificial Intelligence
Optimal online-list batch scheduling
Information Processing Letters
Real-time problem-solving with contract algorithms
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Contract algorithms and robots on rays: unifying two scheduling problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Adaptive raising strategies optimizing relative efficiency
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An optimal competitive strategy for walking in 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
An O(log2k)-competitive algorithm for metric bipartite matching
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Localization: approximation and performance bounds to minimize travel distance
IEEE Transactions on Robotics
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On the optimality of spiral search
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Searching for an axis-parallel shoreline
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Online graph exploration: new results on old and new algorithms
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Multi-target ray searching problems
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Competitive search in symmetric trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Optimal competitive online ray search with an error-prone robot
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Computational Geometry: Theory and Applications
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Learning heuristic functions for large state spaces
Artificial Intelligence
Flood search under the California Split rule
Operations Research Letters
Searching for an axis-parallel shoreline
Theoretical Computer Science
Collaborative search on the plane without communication
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Memory lower bounds for randomized collaborative search and implications for biology
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Intensity-based navigation with global guarantees
Autonomous Robots
Hi-index | 0.01 |