Recherche
-
Approximation bounds for Black Hole Search problems
(Networks. vol. 52, n° 4, pp. 216--226, 2008-12)Article de revue -
On the Complexity of Bandwidth Allocation in Radio Networks
(Theoretical Computer Science. vol. 406, n° 3, pp. 225--239, 2008-10)Article de revue -
A randomized algorithm for the joining protocol in dynamic distributed networks
(Theoretical Computer Science. vol. 406, n° 3, pp. 248--262, 2008-10)Article de revue -
Analysis of Divisible Load Scheduling with Result Collection on Heterogeneous Systems
(IEICE Transactions on Communications, 2008)Article de revue -
Decidable Call-by-Need Computations in Term Rewriting
(Information and Computation. vol. 2, n° 196, pp. 95-126, 2005)Article de revue -
The CAT for efficient 2D and 3D interaction as an alternative to mouse adaptations
(ACM Transactions on Graphics. vol. 23, pp. 731--731, 2004)Article de revue -
Gathering asynchronous oblivious mobile robots in a ring
(Theoretical Computer Science. vol. 390, n° 1, pp. 27--39, 2008-01)Article de revue -
Hardness and approximation results for black hole search in arbitrary graphs
(Theoretical Computer Science. vol. 384, n° 2-3, pp. 201-221, 2007-10)Article de revue -
Hardness results and approximation algorithms of k-tuple domination in graphs
(Information Processing Letters. vol. 89, n° 2, pp. 75--83, 2004-01)Article de revue -
ProteomeBinders: planning a European resource of affinity reagents for analysis of the human proteome
(Nature Methods. vol. 4, pp. 13-17, 2007)Article de revue