Recherche
-
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
(Algorithmica. vol. 65, n° 3, pp. 562-583, 2013-03)Article de revue -
Worst-case optimal exploration of terrains with obstacles
(Information and Computation. vol. 225, pp. 16-28, 2013-04-01)Article de revue -
More efficient periodic traversal in anonymous undirected graphs
(Theoretical Computer Science. vol. 444, pp. pages 60-76, 2012-07)Article de revue -
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles
(Algorithmica. vol. 62, n° 3-4, pp. pages 1006-1033, 2012-04)Article de revue -
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 -
Distributed computing with advice: information sensitivity of graph coloring
(Distributed Computing. vol. 21, n° 6, pp. 395-403, 2009-03)Article de revue -
Label-Guided Graph Exploration by a Finite Automaton
(ACM Transactions on Algorithms. vol. 4, n° 4, pp. Article 42, 2008-08)Article de revue