D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, Resilient overlay networks, SOSP, pp.131-145, 2001.

J. Aspnes, J. Kirsch, and A. Krishnamurthy, Load balancing and locality in range-queriable data structures, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.115-124, 2004.
DOI : 10.1145/1011767.1011785

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

J. Augustine, E. Anisur-rahaman-molla, G. Morsy, P. Pandurangan, E. Robinson et al., Storage and search in dynamic peer-to-peer networks, Proceedings of the 25th ACM symposium on Parallelism in algorithms and architectures, SPAA '13, pp.53-62, 2013.
DOI : 10.1145/2486159.2486170

J. Augustine, G. Pandurangan, and P. Robinson, Fast byzantine agreement in dynamic networks, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.74-83, 2013.
DOI : 10.1145/2484239.2484275

J. Augustine, G. Pandurangan, P. Robinson, S. Roche, and E. Upfal, Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp.350-369, 2015.
DOI : 10.1109/FOCS.2015.29

B. Awerbuch and C. Scheideler, The hyperring: a low-congestion deterministic data structure for distributed environments, SODA, pp.318-327, 2004.

B. Awerbuch and C. Scheideler, Towards scalable and robust overlay networks, IPTPS, 2007.

B. Awerbuch and C. Scheideler, Towards a scalable and robust dht, Theory of Computing Systems, pp.234-260, 2009.

A. Salman, H. Baset, and . Schulzrinne, An analysis of the skype peer-to-peer internet telephony protocol. arXiv preprint cs, 2004.

A. Berns, S. Ghosh, V. Sriram, and . Pemmaraju, Building self-stabilizing overlay networks with the transitive closure framework, Symposium on Self-Stabilizing Systems, pp.62-76, 2011.

E. Caron, F. Desprez, F. Petit, and C. Tedeschi, SNAP-STABILIZING PREFIX TREE FOR PEER-TO-PEER SYSTEMS, Parallel Processing Letters, vol.20, issue.01, pp.15-30, 2010.
DOI : 10.1142/S012962641000003X
URL : https://hal.archives-ouvertes.fr/hal-01429571

T. Clouser, M. Nesterenko, and C. Scheideler, Tiara: A self-stabilizing deterministic skip list and skip graph, Theoretical Computer Science, vol.428, pp.18-35, 2012.
DOI : 10.1016/j.tcs.2011.12.079

S. Dolev and R. I. Kat, Hypertree for self-stabilizing peer-to-peer systems, NCA, pp.25-32, 2004.

M. Drees, R. Gmyr, and C. Scheideler, Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration, Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '16, pp.417-427, 2016.
DOI : 10.1145/2935764.2935783

D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. Strothmann, On Stabilizing Departures in Overlay Networks, Symposium on Self-Stabilizing Systems, pp.48-62, 2014.
DOI : 10.1007/978-3-319-11764-5_4

D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid et al., Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization, LATIN, pp.294-305, 2010.
DOI : 10.1007/978-3-642-12200-2_27

S. Gambs, R. Guerraoui, H. Harkous, F. Huc, and A. Kermarrec, Scalable and Secure Polling in Dynamic Distributed Networks, 2012 IEEE 31st Symposium on Reliable Distributed Systems, pp.181-190, 2012.
DOI : 10.1109/SRDS.2012.63
URL : https://hal.archives-ouvertes.fr/hal-00723566

T. Michael, . Goodrich, J. Michael, J. Z. Nelson, and . Sun, The rainbow skip graph: a fault-tolerant constantdegree distributed data structure, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp.384-393, 2006.

R. Guerraoui, F. Huc, and A. Kermarrec, Highly dynamic distributed computing with byzantine failures, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.176-183, 2013.
DOI : 10.1145/2484239.2484263
URL : https://hal.archives-ouvertes.fr/hal-00870960

P. Thomas, J. Hayes, A. Saia, and . Trehan, The forgiving graph: a distributed data structure for low stretch under adversarial attack, Distributed Computing, pp.261-278, 2012.

R. Jacob, A. 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

Y. Steven, I. Ko, I. Hoque, and . Gupta, Using tractable and realistic churn models to analyze quiescence behavior of distributed protocols, Reliable Distributed Systems SRDS'08. IEEE Symposium on, pp.259-268, 2008.

A. Koutsopoulos, C. Scheideler, and T. Strothmann, Towards a universal approach for the finite departure problem in overlay networks, Stabilization, Safety, and Security of Distributed Systems -17th International Symposium, SSS 2015 Proceedings, volume 9212 of Lecture Notes in Computer Science, pp.201-216, 2015.

F. Kuhn, S. Schmid, and R. Wattenhofer, Towards worst-case churn resistant peer-to-peer systems, Distributed Computing, vol.21, issue.2, pp.249-267, 2010.
DOI : 10.1007/s00446-010-0099-z

G. Mega, A. Montresor, and G. P. Picco, On churn and communication delays in social overlays, 2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P), pp.214-224, 2012.
DOI : 10.1109/P2P.2012.6335802

S. Nakamoto, Bitcoin: A peer-to-peer electronic cash system, p.28, 2008.

R. Mohd-nor, M. Nesterenko, and C. Scheideler, Corona: A stabilizing deterministic messagepassing skip list, 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp.356-370, 2011.

R. Mohd-nor, M. Nesterenko, and S. Tixeuil, Linearizing peer-to-peer systems with oracles, Stabilization, Safety, and Security of Distributed Systems -15th International Symposium, SSS 2013 Proceedings, pp.221-236, 2013.

W. Pugh, Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, vol.33, issue.6, pp.668-676, 1990.
DOI : 10.1145/78973.78977

I. T. Antony, P. Rowstron, and . Druschel, Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, Middleware, pp.329-350, 2001.

J. Saia and A. Trehan, Picking up the Pieces: Self-Healing in reconfigurable networks, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.1-12, 2008.
DOI : 10.1109/IPDPS.2008.4536326

A. Shaker, S. Douglas, and . Reeves, Self-Stabilizing Structured Ring Topology P2P Systems, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05), pp.39-46, 2005.
DOI : 10.1109/P2P.2005.34

I. Stoica, R. Morris, D. Liben-nowell, D. R. Karger, M. F. Kaashoek et al., Chord: a scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Transactions on Networking, vol.11, issue.1, pp.17-32, 2003.
DOI : 10.1109/TNET.2002.808407

D. Stutzbach and R. Rejaie, Understanding churn in peer-to-peer networks, Proceedings of the 6th ACM SIGCOMM on Internet measurement , IMC '06, pp.189-202, 2006.
DOI : 10.1145/1177080.1177105