Z. Bouzid, M. Raynal, and P. Sutra, Anonymous Obstruction-free (n, k)-Set Agreement with n ? k + 1 Atomic Read/Write Registers RR 2027, 2015.

E. Borowsky and E. Gafni, -resilient asynchronous computations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, p.93
DOI : 10.1145/167088.167119
URL : https://hal.archives-ouvertes.fr/hal-00896459

S. Chaudhuri, 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

C. Delporte, H. Fauconnier, E. Gafni, and L. Lamport, Adaptive Register Allocation with a Linear Number of Registers, p.13
DOI : 10.1007/978-3-642-41527-2_19
URL : https://hal.archives-ouvertes.fr/hal-00922425

C. Delporte, H. Fauconnier, E. Gafni, and R. S. , Black art: obstruction-free k-set agreement with |MWMR registers| < |proccesses|, p.13
URL : https://hal.archives-ouvertes.fr/hal-00922423

C. Delporte, H. Fauconnier, P. Kuznetsov, and E. Ruppert, On the Space Complexity of Set Agreement?, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, p.15
DOI : 10.1145/2767386.2767406
URL : https://hal.archives-ouvertes.fr/hal-01251563

L. Lamport, Concurrent reading and writing, Communications of the ACM, vol.20, issue.11, pp.806-811, 1977.
DOI : 10.1145/359863.359878

G. Taubenfeld, Contention-sensitive data structure and algorithms, p.9