Recherche
-
Remembering Without Memory: Tree Exploration by Asynchronous Oblivious Robots
(Theoretical Computer Science. vol. 411, n° 14-15, pp. 1583-1598, 2010-03)Article de revue -
Fast radio broadcasting with advice
(Theoretical Computer Science. vol. 411, n° 14-15, pp. 1544-1557, 2010-03)Article de revue -
Optimal Exploration of Terrains with Obstacles
(2009-12-18)Autre document -
Distributed computing with advice: information sensitivity of graph coloring
(Distributed Computing. vol. 21, n° 6, pp. 395-403, 2009-03)Article de revue -
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Label-Guided Graph Exploration by a Finite Automaton
(ACM Transactions on Algorithms. vol. 4, n° 4, pp. Article 42, 2008-08)Article de revue -
Tree exploration with advice
(Information and Computation. vol. 206, n° 11, pp. 1276-1287, 2008-11)Article de revue -
Setting port numbers for fast graph exploration
(Theoretical Computer Science. vol. 401, n° 1-3, pp. 236-242, 2008-07)Article de revue -
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
Communication dans un congrès -
Impact of memory size on graph exploration capability
(Discrete Applied Mathematics. vol. 156, n° 12, pp. 2310-2319, 2008-06)Article de revue