K. Aberer, P. Cudre-mauroux, A. Datta, Z. Despotovic, M. Hauswith et al., P-Grid: A Self-Organizing Access Structure for P2P Information Systems, CoopIS, 2001.
DOI : 10.1007/3-540-44751-2_15

I. Abraham, J. Aspnes, and J. Yuan, Skip B-Trees, Ninth International Conference on Principles of Distributed Systems (pre-proceedings, pp.284-295, 2005.
DOI : 10.1109/TNET.2002.808407

J. Aspnes and U. Wieder, The expansion and mixing time of skip graphs with applications, Distributed Computing, pp.385-393, 2008.

S. Baehni, P. T. Eugster, and R. Guerraoui, Data-aware multicast, International Conference on Dependable Systems and Networks, 2004, 2004.
DOI : 10.1109/DSN.2004.1311893

S. Bianchi, A. K. Datta, P. Felber, and M. Gradinariu, Stabilizing Peer-to-Peer Spatial Filters, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007.
DOI : 10.1109/ICDCS.2007.139

URL : https://hal.archives-ouvertes.fr/hal-01336171

R. Y. Zhang and A. Krishnamurthy, Brushwood: Distributed trees in peer-topeer systems, 2005.

E. Caron, F. Desprez, C. Fourdrignier, F. Petit, and C. Tedeschi, A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems, HiPC, 2006.
DOI : 10.1007/11945918_21

URL : https://hal.archives-ouvertes.fr/hal-01430504

M. Castro, P. Druschel, A. Kermarrec, A. Nandi, A. I. Rowstron et al., SplitStream: High-Bandwidth Content Distribution in Cooperative Environments, IPTPS, 2003.
DOI : 10.1007/978-3-540-45172-3_27

C. Cooper, M. Dyer, and A. Handley, The flip markov chain and a randomising P2P protocol, Proceedings of the 28th ACM symposium on Principles of distributed computing, PODC '09, pp.141-150, 2009.
DOI : 10.1145/1582716.1582742

A. Czumaj and M. Kutylowski, Delayed path coupling and generating random permutations. Random Struct, Algorithms, vol.17, issue.3-4, pp.238-259, 2000.

S. Dolev and N. Tzachar, Spanders, Proceedings of the 2010 ACM Symposium on Applied Computing, SAC '10, pp.1309-1314, 2010.
DOI : 10.1145/1774088.1774369

C. Du-mouza, W. Litwin, and P. Rigaux, SD-Rtree: A Scalable Distributed Rtree, 2007 IEEE 23rd International Conference on Data Engineering, pp.296-305, 2007.
DOI : 10.1109/ICDE.2007.367875

P. T. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, and A. Kermarrec, Lightweight probabilistic broadcast, ACM Trans. Comput. Syst, vol.21, issue.4, 2003.

T. Feder, A. Guetz, M. Mihail, and A. Saberi, A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.69-76, 2006.
DOI : 10.1109/FOCS.2006.5

N. Goyal, L. Rademacher, and S. Vempala, Expanders via Random Spanning Trees, Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.576-585, 2009.
DOI : 10.1137/1.9781611973068.64

URL : http://arxiv.org/abs/0807.1496

H. V. Jagadish, B. C. Ooi, and Q. H. Vu, Baton: a balanced tree structure for peer-to-peer networks, VLDB, 2005.

H. V. Jagadish, B. C. Ooi, Q. H. Vu, R. Zhang, and A. Zhou, VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes, 22nd International Conference on Data Engineering (ICDE'06), 2006.
DOI : 10.1109/ICDE.2006.169

C. Law and K. Siu, Distributed construction of random expander networks, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), pp.2133-2143, 2003.
DOI : 10.1109/INFCOM.2003.1209234

M. K. Reiter, A. Samar, and C. Wang, Distributed Construction of a Fault-Tolerant Network from a Tree, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05), pp.155-165, 2005.
DOI : 10.1109/RELDIS.2005.16