Probabilistic quorums for dynamic systems, Distributed Computing, vol.4, issue.2, pp.113-124, 2005. ,
DOI : 10.1007/s00446-005-0139-2
The k-simultaneous consensus problem, Distributed Computing, vol.29, issue.5, pp.185-195, 2010. ,
DOI : 10.1007/s00446-009-0090-8
URL : https://hal.archives-ouvertes.fr/inria-00354248
Dynamic atomic storage without consensus, J. ACM, vol.58, issue.2, p.7, 2011. ,
Pragmatic self-stabilization of atomic memory in messagepassing systems, SSS, lncs #6976, pp.19-31, 2011. ,
Sharing memory robustly in message-passing systems, Journal of the ACM, vol.42, issue.1, pp.124-142, 1995. ,
DOI : 10.1145/200836.200869
(? x × ?z)-based k-set agreement algorithms, OPODIS, lncs#6490, pp.189-204, 2010. ,
DOI : 10.1007/978-3-642-17653-1_16
Parallel Consensus is Harder than Set Agreement in Message Passing, 2013 IEEE 33rd International Conference on Distributed Computing Systems, 2013. ,
DOI : 10.1109/ICDCS.2013.72
URL : https://hal.archives-ouvertes.fr/hal-00992783
The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996. ,
DOI : 10.1145/234533.234549
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993. ,
DOI : 10.1006/inco.1993.1043
Dynamo: amazon's highly available key-value store, SOSP, pp.205-220, 2007. ,
Crash Resilient and Pseudo-Stabilizing Atomic Registers, OPODIS, lncs#7702, pp.135-150, 2012. ,
DOI : 10.1007/978-3-642-35476-2_10
URL : https://hal.archives-ouvertes.fr/hal-00934144
Eventually-serializable data services, Theoretical Computer Science, vol.220, issue.1, pp.113-156, 1999. ,
DOI : 10.1016/S0304-3975(98)00239-4
URL : http://doi.org/10.1016/s0304-3975(98)00239-4
Probabilistic quorum systems in wireless ad hoc networks, ACM Trans. Comput. Syst, vol.28, issue.3, 2010. ,
Two Abstractions for Implementing Atomic Objects in Dynamic Systems, OPODIS, lncs#3974, pp.73-87, 2006. ,
DOI : 10.1007/978-3-540-39989-6_7
The extended BG-simulation and the characterization of t-resiliency, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.85-92, 2009. ,
DOI : 10.1145/1536414.1536428
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services, ACM SIGACT News, vol.33, issue.2, pp.51-59, 2002. ,
DOI : 10.1145/564585.564601
Rambo: a robust, reconfigurable atomic memory service for dynamic networks, Distributed Computing, pp.225-272, 2010. ,
DOI : 10.1007/s00446-010-0117-1
The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999. ,
DOI : 10.1145/331524.331529
On interprocess communication, Distributed Computing, vol.21, issue.2, pp.77-101, 1986. ,
DOI : 10.1007/BF01786227
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1038
Probabilistic Quorum Systems, Information and Computation, vol.170, issue.2, pp.184-206, 2001. ,
DOI : 10.1006/inco.2001.3054
Session guarantees for weakly consistent replicated data, Proceedings of 3rd International Conference on Parallel and Distributed Information Systems, pp.140-149, 1994. ,
DOI : 10.1109/PDIS.1994.331722
Overcoming the Majority Barrier in Large-Scale Systems, DISC, lncs#2848, pp.352-366, 2003. ,
DOI : 10.1007/978-3-540-39989-6_25