T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Widmayer, Space-Filling Curves and their Use in the Design of Geometric Data Structures, Theoretical Computer Science, vol.181, 1997.

T. Bansal and N. Mittal, A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), pp.1-12, 2010.
DOI : 10.1109/IPDPS.2010.5470412

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science, 2004.
DOI : 10.1007/978-3-662-07964-5
URL : https://hal.archives-ouvertes.fr/hal-00344237

J. Borgström, U. Nestmann, L. Onana-alima, and D. Gurov, Verifying a Structured Peer-to-Peer Overlay Network: The Static Case, Global Computing'04, pp.250-265, 2004.
DOI : 10.1007/3-540-45518-3_18

T. Clouser, M. Nesterenko, and C. Scheideler, Tiara: A Self-stabilizing Deterministic Skip List, 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp.124-140, 2008.
DOI : 10.1145/234533.234549

E. N. Gilbert, Gray Codes and Paths on the n-Cube, Bell System Technical Journal, vol.37, issue.3, pp.815-826, 1958.
DOI : 10.1002/j.1538-7305.1958.tb03887.x

T. Hayes, N. Rustagi, J. Saia, and A. Trehan, The forgiving tree, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.203-212, 2008.
DOI : 10.1145/1400751.1400779

T. Hayes, J. Saia, and A. Trehan, The forgiving graph, Proceedings of the 28th ACM symposium on Principles of distributed computing, PODC '09, pp.121-130, 2009.
DOI : 10.1145/1582716.1582740

A. Iftene and G. Ciobanu, Formalizing peer-to-peer systems based on content addressable network, International Journal of Computers Communications & Control, pp.268-273, 2006.

R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, A Self-stabilizing and Local Delaunay Graph Construction, 20th International Symposium on Algorithms and Computation, pp.771-780, 2009.
DOI : 10.1007/978-3-642-10631-6_78

R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, A distributed polylogarithmic time algorithm for self-stabilizing skip graphs, Proceedings of the 28th ACM symposium on Principles of distributed computing, PODC '09, pp.131-140, 2009.
DOI : 10.1145/1582716.1582741

R. David, M. Karger, and . Ruhl, Simple efficient load-balancing algorithms for peer-topeer systems, Theory Comput. Syst, vol.39, issue.6, pp.787-804, 2006.

S. Kniesburges, A. Koutsopoulos, and C. Scheideler, Re-Chord, Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, SPAA '11, pp.235-244, 2011.
DOI : 10.1145/1989493.1989527

X. Li, J. Misra, and C. G. Plaxton, Concurrent Maintenance of Rings, Distributed Computing, vol.22, issue.2, pp.126-148, 2006.
DOI : 10.1007/s00446-006-0008-7

N. A. Lynch, D. Malkhi, and D. Ratajczak, Atomic Data Access in Distributed Hash Tables, First International Workshop on Peer-to-Peer Systems, pp.295-305, 2002.
DOI : 10.1007/3-540-45748-8_28

H. Park, J. Yang, J. Park, S. G. Kang, and J. Choi, A Survey on Peer-to-Peer Overlay Network Schemes, 2008 10th International Conference on Advanced Communication Technology, 2008.
DOI : 10.1109/ICACT.2008.4493931

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A Scalable Content- Adressable Network, ACM SIGCOMM, pp.161-172, 2001.
DOI : 10.1145/964723.383072
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.1538

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

M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, HyperCuP ??? Hypercubes, Ontologies, and Efficient Search on Peer-to-Peer Networks, AP2PC, pp.112-124, 2002.
DOI : 10.1007/3-540-45074-2_11

C. Schmidt and M. Parashar, Squid: Enabling search in DHT-based systems, Journal of Parallel and Distributed Computing, vol.68, issue.7, 2008.
DOI : 10.1016/j.jpdc.2008.02.003

I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, Chord: A Scalable Peer-to-Peer Lookup service for Internet Applications, ACM SIGCOMM Inria RESEARCH CENTRE SOPHIA ANTIPOLIS ? MÉDITERRANÉE 2004 route des Lucioles -BP 93, pp.149-160, 2001.