Recherche
-
Sparse Spanners vs. Compact Routing
Communication dans un congrès -
Routage compact optimal dans les $(k,r)$-constellations
(Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques. vol. 30, n° 05/2011, pp. 485-513, 2011-05)Article de revue -
On approximate distance labels and routing schemes with affine stretch
Communication dans un congrès -
An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps
(Birkhäuser Boston, 2011)Chapitre d'ouvrage -
Network Verification via Routing Table Queries
Communication dans un congrès -
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
Communication dans un congrès -
Synchronous Rendezvous for Location-Aware Agents
Communication dans un congrès -
Structural Information and Communication Complexity. 18th International Colloquium, SIROCCO 2011, Gdańsk, Poland, June 26-29, 2011
(Springer, 2011-06-24)Ouvrage -
Derandomizing random walks in undirected graphs using locally fair exploration strategies
(Distributed Computing. vol. 24, n° 2, pp. 91-99, 2011)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