Recherche
-
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
(Algorithmica. vol. 65, n° 3, pp. 562-583, 2013-03)Article de revue -
Optimal Patrolling of Fragmented Boundaries
Communication dans un congrès -
Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network
(Université Sciences et Technologies - Bordeaux I)HDR -
Worst-case optimal exploration of terrains with obstacles
(Information and Computation. vol. 225, pp. 16-28, 2013-04-01)Article de revue -
On the Communication Complexity of Distributed Name-Independent Routing Schemes
Communication dans un congrès -
Algorithme distribué de routage compact en temps optimal
Communication dans un congrès -
Partitioning a square into rectangles: NP-completeness and approximation algorithms
(Algorithmica. vol. 34, pp. 217-239, 2002)Article de revue -
The iso-level scheduling heuristic for heterogeneous processors
Communication dans un congrès