L. Arge, D. Eppstein, and M. T. Goodrich, Skip-webs, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05, pp.69-76, 2005.
DOI : 10.1145/1073814.1073827

J. Aspnes and G. Shah, Skip graphs, Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.384-393, 2003.
DOI : 10.1145/1290672.1290674

]. S. Berchtold, C. Bohm, and H. Kriegel, The pyramidtechnique: Towards breaking the curse of dimensionality, Proc. of SIGMOD, 1998.

A. Bharambe, M. Agrawal, and S. Seshan, Mercury:supporting scalable multi-attribute range queries, ACM SIGCOMM'04, 2004.

F. M. Cuenca-acuna, C. Peery, R. P. Martin, and T. D. Nguyen, PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on, pp.236-249, 2003.
DOI : 10.1109/HPDC.2003.1210033

A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database maintenance, Proc. of ACM PODC, 1987.

F. L. Fessant, Mldonkey, a multi-network file-sharing client, 2002.

R. Guerraoui, S. B. Handurukande, and A. Kermarrec, Gosskip: a gossip-based structured overlay network for efficient content-based filtering, 2004.

N. J. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman, Skipnet: A scalable overlay network with practical locality properties, Proc. of USITS, 2003.

M. Jelasity, R. Guerraoui, A. Kermarrec, and M. Van-steen, The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations, Middleware, pp.79-98, 2004.
DOI : 10.1038/30918

B. C. Ooi, K. Tan, C. Yu, and S. Bressan, Indexing the edges a simple and yet efficient approach to highdimensional indexing, Proc. of PODS, 2000.

W. Pugh, Skip lists: A probabilistic alternative to balanced trees, CACM, 1990.

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content-addressable network, Proc. of ACM SIGCOMM, 2001.

A. Rowstron and P. Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Proc. of Middleware, 2001.
DOI : 10.1007/3-540-45518-3_18

I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, Proc. of SIGCOMM, 2001.

S. Voulgaris, E. Rivì-ere, A. Kermarrec, and M. Van-steen, Sub-2-sub: Self-organizing content-based publish and subscribe for dynamic and large scale collaborative networks, IPTPS'06: the fifth International Workshop on Peer-to-Peer Systems, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070248

S. Voulgaris and M. Van-steen, An Epidemic Protocol for Managing Routing Tables in Very Large Peer-to-Peer Networks, Proc. IFIP/IEEE DSOM, 2003.
DOI : 10.1007/978-3-540-39671-0_5

S. Voulgaris and M. Van-steen, Epidemic-Style Management of Semantic Overlays for Content-Based Searching, EuroPar, 2005.
DOI : 10.1007/11549468_125

B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph et al., Tapestry: A Resilient Global-Scale Overlay for Service Deployment, IEEE Journal on Selected Areas in Communications, vol.22, issue.1, 2004.
DOI : 10.1109/JSAC.2003.818784