A new distributed algorithm to find breadth first search trees
IEEE Transactions on Information Theory
Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Theoretical Computer Science
How to learn an unknown environment (extended abstract)
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
Walking an unknown street with bounded detour
Computational Geometry: Theory and Applications
Inference of finite automata using homing sequences
Information and Computation
Piecemeal Learning of an Unknown Environment
Machine Learning - Special issue on COLT '93
ALGORITHMS FOR EXPLORING AN UNKNOWN GRAPH
ALGORITHMS FOR EXPLORING AN UNKNOWN GRAPH
Learning branches and learning to win closed games
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Exploring unknown environments
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
Polylogarithmic-overhead piecemeal graph exploration
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Tree exploration with little memory
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The power of a pebble: exploring and mapping directed graphs
Information and Computation
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
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
Optimal Graph Exploration without Good Maps
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Tree exploration with little memory
Journal of Algorithms
Optimal graph exploration without good maps
Theoretical Computer Science
Tree exploration with logarithmic memory
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Information and Computation
Multi-robot tree and graph exploration
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Remembering without memory: Tree exploration by asynchronous oblivious robots
Theoretical Computer Science
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG)
Mobile agent algorithms versus message passing algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Election in the qualitative world
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Deterministic network exploration by a single agent with Byzantine tokens
Information Processing Letters
Finding patterns in an unknown graph
AI Communications - The Symposium on Combinatorial Search
Deterministic network exploration by anonymous silent agents with local traffic reports
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |