M. Herlihy, Dynamic quorum adjustment for partitioned data, ACM Transactions on Database Systems, vol.12, issue.2, pp.170-194, 1987.
DOI : 10.1145/22952.22953

N. Lynch and A. Shvartsman, RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks, Proc. of 16th International Symposium on Distributed Computing, pp.173-190, 2002.
DOI : 10.1007/3-540-36108-1_12

R. Friedman, M. Raynal, and C. Travers, Two Abstractions for Implementing Atomic Objects in Dynamic Systems, 9th International Conference on Principles of Distributed Systems (OPODIS), 2005.
DOI : 10.1007/978-3-540-39989-6_7

G. Chockler, S. Gilbert, V. Gramoli, P. Musial, and A. Shvartsman, Reconfigurable distributed storage for dynamic networks, Proceedings of 9th International Conference on Principles of Distributed Systems, pp.214-219, 2005.

D. Malkhi, M. Reiter, A. Wool, and R. Wright, Probabilistic Quorum Systems, Information and Computation, vol.170, issue.2, pp.184-206, 2001.
DOI : 10.1006/inco.2001.3054
URL : http://doi.org/10.1006/inco.2001.3054

M. Naor and A. Wool, The Load, Capacity, and Availability of Quorum Systems, SIAM Journal on Computing, vol.27, issue.2, pp.423-447, 1998.
DOI : 10.1137/S0097539795281232

U. Nadav and M. Naor, The Dynamic And-Or Quorum System, Lecture Notes In Computer Science, vol.3724, pp.472-486, 2005.
DOI : 10.1007/11561927_34

I. Abraham and D. Malkhi, Probabilistic quorums for dynamic systems, Distributed Computing, vol.4, issue.2, pp.113-124, 2005.
DOI : 10.1007/s00446-005-0139-2

V. Gramoli, E. Anceaume, and A. Virgillito, SQUARE, Proceedings of the 2007 ACM symposium on Applied computing , SAC '07, pp.574-579, 2007.
DOI : 10.1145/1244002.1244133
URL : https://hal.archives-ouvertes.fr/hal-00916758

N. Lynch, Distributed Algorithms, 1996.

R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, Chord: A scalable peer-topeer lookup service for internet applications, In: ACM SIGCOMM, 2001.

A. J. Ganesh, A. M. Kermarrec, and L. Massoulié, Peer-to-peer membership management for gossip-based protocols, IEEE Transactions on Computers, vol.52, issue.2, pp.139-149, 2003.
DOI : 10.1109/TC.2003.1176982

L. Merrer, E. Kermarrec, A. M. Massoulié, and L. , Peer to peer size estimation in large and dynamic networks: A comparative study, 2006 15th IEEE International Conference on High Performance Distributed Computing, 2006.
DOI : 10.1109/HPDC.2006.1652131
URL : https://hal.archives-ouvertes.fr/inria-00070184

S. Voulgaris, D. Gavidia, and M. Van-steen, CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays, Journal of Network and Systems Management, vol.21, issue.6, pp.197-217, 2005.
DOI : 10.1007/s10922-005-4441-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.4965

K. Iwanicki, Gossip-based dissemination of time, 2005.

A. Fernández, V. Gramoli, E. Jiménez, A. M. Kermarrec, and M. Raynal, Distributed Slicing in Dynamic Systems, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007.
DOI : 10.1109/ICDCS.2007.102

V. Gramoli, A. M. Kermarrec, A. Mostefaoui, M. Raynal, and B. Sericola, Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime, Proceedings of the On-The- Move International Workshop on Reliability in Decentralized Distributed Systems, pp.1470-1479, 2006.
DOI : 10.1007/11915072_52
URL : https://hal.archives-ouvertes.fr/inria-00201164