, On space-stretch trade-offs, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '06, pp.207-216, 2006.
DOI : 10.1145/1148109.1148144
URL : https://hal.archives-ouvertes.fr/hal-00371404
, The optimised routing protocol for mobile ad-hoc networks: protocol specification, 2001.
, Efficient algorithms for constructing (1 + ?, ?)-spanners in the distributed and streaming models, Distributed Computing, pp.375-385, 2006.
, Routing in Trees, 28 th International Colloquium on Automata, Languages and Programming, pp.757-772, 2001.
DOI : 10.1007/3-540-48224-5_62
URL : https://hal.archives-ouvertes.fr/hal-00307398
, Remote-spanners: What to know beyond neighbors, 2009 IEEE International Symposium on Parallel & Distributed Processing, 2001.
DOI : 10.1109/IPDPS.2009.5161041
, Hierarchical routing for large networks Performance evaluation and optimization, Computer Networks (1976), vol.1, issue.3, pp.155-174, 1977.
DOI : 10.1016/0376-5075(77)90002-2
, An optimal synchronizer for the hypercube, th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp.77-85, 1987.
, Low Distortion Spanners, 34 th International Colloquium on Automata, Languages and Programming (ICALP) 27 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp.78-89, 2007.
DOI : 10.1007/978-3-540-73420-8_9
, Compact routing schemes, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.1-10, 2001.
DOI : 10.1145/378580.378581
, Ceci peut être fait sur la base des algorithmes de routage R x (plus précisément des programmes de longueur µ implantant ces algorithmes) de tous les sommets des chemins s i ? a i et s i ? b i , ainsi que les adresses (de longueur µ) des sommets de T et d'un certain nombre de numéros de ports. Le programme P simule alors la route de s i à t j sur sa première partie