J. Aspnes and G. Shah, Skip graphs, ACM Transactions on Algorithms, vol.3, issue.4, p.37, 2007.
DOI : 10.1145/1290672.1290674

A. Bharambe, M. Agrawal, and S. Seshan, Mercury: Supporting Scalable Multi-Attribute Range Queries, Proceedings of the SIGCOMM Symposium, 2004.

E. Caron, A. K. Datta, F. Petit, and C. Tedeschi, Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems, 2008 Symposium on Reliable Distributed Systems, pp.6-8, 2008.
DOI : 10.1109/SRDS.2008.18

E. Caron, F. Desprez, and C. Tedeschi, Dynamic Prefix Tree for Service Discovery within Large Scale Grids, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), pp.106-113, 2006.
DOI : 10.1109/P2P.2006.16
URL : https://hal.archives-ouvertes.fr/hal-01430005

E. Caron, F. Desprez, and C. Tedeschi, Efficiency of tree-structured peer-to-peer service discovery systems, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.14-18, 2008.
DOI : 10.1109/IPDPS.2008.4536198
URL : https://hal.archives-ouvertes.fr/inria-00287800

P. Chan and D. Abramson, A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids, Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007), pp.10-13, 2007.
DOI : 10.1109/E-SCIENCE.2007.6

A. Datta, M. Hauswirth, R. John, R. Schmidt, and K. Aberer, Range Queries in Trie-Structured Overlays, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05), 2005.
DOI : 10.1109/P2P.2005.31

E. W. Dijkstra, Self-stabilizing systems in spite of distributed control, Communications of the ACM, vol.17, issue.11, pp.643-644, 1974.
DOI : 10.1145/361179.361202

S. Dolev and T. Herman, SuperStabilizing protocols for dynamic distributed systems, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, 1997.
DOI : 10.1145/224964.224993
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.5949

T. Hérault, P. Lemarinier, O. Peres, L. Pilard, and J. Beauquier, A Model for Large Scale Self-Stabilization, 2007 IEEE International Parallel and Distributed Processing Symposium, pp.1-10, 2007.
DOI : 10.1109/IPDPS.2007.370298

S. Legtchenko, S. Monnet, P. Sens, and G. Muller, Churn-Resilient Replication Strategy for Peer-to-Peer Distributed Hash-Tables, The 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2009.
DOI : 10.1007/978-3-642-05118-0_34
URL : https://hal.archives-ouvertes.fr/inria-00374095

N. Leibowitz, M. Ripeanu, and A. Wierzbicki, Deconstructing the Kazaa network, Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003, 2003.
DOI : 10.1109/WIAPP.2003.1210295

S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker, Prefix Hash Tree: an Indexing Data Structure over Distributed Hash Tables, Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, 2004.

A. Rowstron and P. Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Middleware, 2001.
DOI : 10.1007/3-540-45518-3_18
URL : http://admis.fudan.edu.cn/member/yztang/Papers/P2P/overlay/Pastry Scalable, decentralized object location and routing for large scale p2p systems.pdf

C. Schmidt and M. Parashar, Squid: Enabling search in DHT-based systems, Journal of Parallel and Distributed Computing, vol.68, issue.7, pp.962-975, 2008.
DOI : 10.1016/j.jpdc.2008.02.003
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.390.2327

Y. Shu, B. C. Ooi, K. Tan, and A. Zhou, Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems, Peer-to-Peer Computing, 2005.

I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, Chord: A Scalable Peer-to-Peer Lookup service for Internet Applications, ACM SIGCOMM, pp.149-160, 2001.

P. Trunfio, D. Talia, H. Papadakis, P. Fragopoulou, M. Mordacchini et al., Peer-to-Peer resource discovery in Grids: Models and systems, Future Generation Computer Systems, vol.23, issue.7, pp.864-878, 2007.
DOI : 10.1016/j.future.2006.12.003