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 -
Communication algorithms with advice
(Journal of Computer and System Sciences. vol. 76, n° 3-4, pp. 222-232, 2010)Article de revue -
The Cost of Monotonicity in Distributed Graph Searching
(Distributed Computing. vol. 22, n° 2, pp. 117-127, 2009)Article de revue -
Euler Tour Lock-in Problem in the Rotor-Router Model
Communication dans un congrès -
Distributed computing with advice: information sensitivity of graph coloring
(Distributed Computing. vol. 21, n° 6, pp. 395-403, 2009-03)Article de revue -
More Efficient Periodic Traversal in Anonymous Undirected Graphs
Communication dans un congrès -
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