Recherche
-
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
(Algorithmica. vol. 65, n° 3, pp. 562-583, 2013-03)Article de revue -
Time versus space trade-offs for rendezvous in trees
(Distributed Computing. vol. 27, n° 2, pp. 95-109, 2014-04)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 -
Time vs. space trade-offs for rendezvous in trees
Communication dans un congrès -
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains
(Theory of Computing Systems. vol. 52, n° 2, pp. 179-199, 2013)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 -
Distributed computing with advice: information sensitivity of graph coloring
(Distributed Computing. vol. 21, n° 6, pp. 395-403, 2009-03)Article de revue -
Tree exploration with advice
(Information and Computation. vol. 206, n° 11, pp. 1276-1287, 2008-11)Article de revue -
Impact of memory size on graph exploration capability
(Discrete Applied Mathematics. vol. 156, n° 12, pp. 2310-2319, 2008-06)Article de revue