Long range contacts in overlay networks, Euro-par 2005, vol.3648, pp.1153-1162, 2005. ,
Voronoi diagrams, Handbook of Computational Geometry, pp.201-290, 2000. ,
Efficient routing in networks with long range contacts, DISC '01: Proceedings of the 15th International Conference on Distributed Computing, pp.270-284, 2001. ,
Algorithmic Geometry, 1998. ,
Could any graph be turned into a small world? Theoretical Computer Science, 2005. ,
DOI : 10.1007/11561927_46
Navigation in a small world, Nature, vol.406, 2000. ,
DOI : 10.1515/9781400841356.551
The small-world phenomenon: An algorithmic perspective, Proc. 32nd ACM Symposium on Theory of Computing, 2000. ,
DOI : 10.1145/335305.335325
Localized routing for wireless ad hoc networks, Proc. of IEEE ICC, 2003. ,
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, Proc. of Middleware, 2001. ,
DOI : 10.1007/3-540-45518-3_18
URL : https://link.springer.com/content/pdf/10.1007%2F3-540-45518-3_18.pdf
A fully distributed peer to peer structure based on 3D Delaunay triangulation, Algotel 2005, 7emes Rencontres Francophones sur les aspects Algorithmiques des Télécommunications, 2005. ,
Chord: A scalable peer-to-peer lookup service for internet applications, Proc. of SIGCOMM'01, 2001. ,
DOI : 10.1109/tnet.2002.808407
Construction of the Voronoi Diagram for "One Million" Generators in Single-Precision Arithmetic, Proceedings of the IEEE, vol.80, pp.1471-1484, 1992. ,
Robust geometric computation based on topological consistency, ICCS '01: Proceedings of the International Conference on Computational Sciences-Part I, pp.12-26, 2001. ,
DOI : 10.1007/3-540-45545-0_10
URL : https://link.springer.com/content/pdf/10.1007%2F3-540-45545-0_10.pdf
, Unité de recherche INRIA Rhône-Alpes 655, avenue de l'Europe -38334 Montbonnot
, Parc Club Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex
LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 ,