Routing in networks with low doubling dimension, 2005. ,
DOI : 10.1109/icdcs.2006.72
URL : https://hal.archives-ouvertes.fr/hal-00400501
Name independent routing for growth bounded networks, 17 th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), pp.49-55, 2005. ,
DOI : 10.1145/1073970.1073978
A group-theoretic model for symmetric interconnection networks, IEEE Trans. Comput, vol.38, pp.555-566, 1989. ,
DOI : 10.1109/12.21148
Fault-tolerant routing in peer-to-peer systems, 21st ACM Symp. on Principles of Distributed Computing (PODC), pp.223-232, 2002. ,
DOI : 10.1145/571860.571862
URL : http://arxiv.org/pdf/cs/0302022
Plongements lipshitzien dans R n, Bull. Soc. Math, vol.111, issue.4, pp.429-448, 1983. ,
DOI : 10.24033/bsmf.1997
URL : http://www.numdam.org/article/BSMF_1983__111__429_0.pdf
Small diameter cayley graphs for finite simple groups, European Journal of Combinatorics, issue.10, pp.507-522, 1989. ,
DOI : 10.1016/s0195-6698(89)80067-8
URL : https://doi.org/10.1016/s0195-6698(89)80067-8
Efficient routing in networks with long range contacts, LNCS Proceedings of 15th International Symposium on Distributed Computing (DISC), vol.2180, pp.270-284, 2001. ,
On hierarchical routing in doubling metrics, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pp.762-771, 2005. ,
DOI : 10.1145/2915183
URL : http://dl.acm.org/ft_gateway.cfm?id=2915183&type=pdf
Nearest-Neighbor Methods for Learning and Vision : Theory and Practice, chapter Nearest-neighbor searching and metric space dimensions. (Survey), 2006. ,
Could any graph be turned into a small world ?, Theoretical Computer Science, Special issue on Complex Networks, 2005. ,
DOI : 10.1007/11561927_46
URL : https://hal.archives-ouvertes.fr/hal-00307531
Asymptotically optimal solutions for small world graphs, LNCS Proceedings of the 19th International Symposium on Distributed Computing (DISC), vol.3724, pp.414-428, 2005. ,
DOI : 10.1007/11561927_30
Macroscopic internet topology and performance measurements from the dns root name servers, USENIX LISA, 2001. ,
Greedy routing in tree-decomposed graphs : a new perspective on the small-world phenomenon, Proceedings of the 13th Annual European Symposium on Algorithms (ESA), pp.791-802, 2005. ,
Eclecticism shrinks even small worlds, Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp.169-178, 2004. ,
DOI : 10.1007/s00446-005-0137-4
URL : https://hal.archives-ouvertes.fr/hal-00307394
Bounded geometries, fractals, and low-distortion embeddings, Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.534-543, 2003. ,
DOI : 10.1109/sfcs.2003.1238226
Fast construction of nets in low dimensional metrics and their applications, Proceedings of the 21th ACM Symposium on Computational Geometry (SoCG), pp.150-158, 2005. ,
Lectures on analysis on metric spaces, 2001. ,
Finding nearest-neighbors in growth-restricted metrics, Proceedings of the 34th annual ACM symposium on Theory of computing (STOC), pp.741-750, 2002. ,
The Small-World Phenomenon : An Algorithmic Perspective, Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pp.163-170, 2000. ,
Close to optimal decentralized routing in long-range contact networks, Theoretical Computer Science special issue on ICALP, vol.04, issue.2-3, pp.294-310, 2005. ,
Know thy neighbor's neighbor : the power of lookahead in randomized p2p networks, Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pp.54-63, 2004. ,
Analyzing kleinberg's (and other) small-world models, 23rd ACM Symp. on Principles of Distributed Computing (PODC), pp.178-187, 2004. ,
DOI : 10.1145/1011767.1011794
The small world problem, Psychology Today, issue.1, p.61, 1967. ,
A new family of cayley expanders, 36th ACM Symposium on Theory of Computing (STOC), pp.445-454, 2004. ,
Distance estimation and object location via rings of neighbors, Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp.41-50, 2005. ,