Probabilistic quorums for dynamic systems, Distributed Computing, vol.4, issue.2, pp.113-124, 2005. ,
DOI : 10.1007/s00446-005-0139-2
P2P Architecture for Self-Atomic Memory, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), pp.214-219, 2005. ,
DOI : 10.1109/ISPAN.2005.67
Sharing memory robustly in message-passing systems, Journal of the ACM, vol.42, issue.1, pp.124-142, 1995. ,
DOI : 10.1145/200836.200869
Reconstructing paxos, pp.42-57, 2003. ,
How fast can a distributed atomic read be?, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.236-245, 2004. ,
DOI : 10.1145/1011767.1011802
Weighted voting for replicated data, Proceedings of the seventh symposium on Operating systems principles , SOSP '79, pp.150-162, 1979. ,
DOI : 10.1145/800215.806583
SQUARE, Proceedings of the 2007 ACM symposium on Applied computing , SAC '07, 2007. ,
DOI : 10.1145/1244002.1244133
URL : https://hal.archives-ouvertes.fr/hal-00916758
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime, Proceedings of the International OTM Workshop on Reliability in Decentralized Distributed systems (OTM'06), pp.1470-1479, 2006. ,
DOI : 10.1007/11915072_52
URL : https://hal.archives-ouvertes.fr/inria-00201164
Operation liveness and gossip management in a dynamic distributed atomic data service, Proc. of the 18th International Conference on Parallel and Distributed Computing Systems (PDCS'05), 2005. ,
Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990. ,
DOI : 10.1145/78969.78972
On interprocess communication, Distributed Computing, vol.5, issue.2, pp.86-101, 1986. ,
DOI : 10.1007/BF01786228
The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998. ,
DOI : 10.1145/279227.279229
Distributed Algorithms, 1996. ,
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks, Proc. of 16th International Symposium on Distributed Computing (DISC'02), pp.173-190, 2002. ,
DOI : 10.1007/3-540-36108-1_12
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
Etna : a faulttolerant algorithm for atomic mutable dht data, 2004. ,
The Dynamic And-Or Quorum System, Proc. of 19th International Symposium on Distributed Computing (DISC'05), pp.472-486, 2005. ,
DOI : 10.1007/11561927_34
Scalable and dynamic quorum systems, Proc. of the 22th annual symposium on Principles of distributed computing (PODC'03), pp.114-122, 2003. ,
DOI : 10.1007/s00446-004-0114-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.4867
A Majority consensus approach to concurrency control for multiple copy databases, ACM Transactions on Database Systems, vol.4, issue.2, pp.180-209, 1979. ,
DOI : 10.1145/320071.320076
How fast can a very robust read be ?, Proceedings of the 25th annual symposium on Principles of distributed computing (PODC'06), 2006. ,