Recherche
-
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 -
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks
(SIAM Journal on Discrete Mathematics. vol. 23, n° 3, pp. 1612--1645, 2009)Article de revue -
Hybrid MPI-Thread Parallelization of the Fast Multipole Method
Communication dans un congrès -
Heterogenous dating service with application to rumor spreading
Communication dans un congrès