Recherche
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
(Distributed Computing. vol. 25, n° 2, pp. 165-178, 2012)Article de revue -
How many oblivious robots can explore a line
(Information Processing Letters. vol. 111, n° 20, pp. 1027-1031, 2011-10-31)Article de revue -
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Communication dans un congrès -
Fast Radio Broadcasting with Advice
Communication dans un congrès