Recherche
-
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Optimal Exploration of Terrains with Obstacles
(2009-12-18)Autre document -
On Space-Stretch Trade-Offs: Upper Bounds
Communication dans un congrès -
On the Tree-Width of Planar Graphs
Communication dans un congrès -
Local Computation of Nearly Additive Spanners
Communication dans un congrès -
What Can be Observed Locally? Round-based Models for Quantum Distributed Computing
Communication dans un congrès -
On the Path Separability of Planar Graphs
Communication dans un congrès -
Distributed computing with advice: information sensitivity of graph coloring
(Distributed Computing. vol. 21, n° 6, pp. 395-403, 2009-03)Article de revue -
Algorithme distribué pour l'extraction des fréquents maximaux
Communication dans un congrès -
What Can be Observed Locally? Round-based Models for Quantum Distributed Computing
(2009)Autre document