J. Aspnes and F. Ellen, Tight Bounds for Adopt-Commit Objects, Theory of Computing Systems, pp.451-474, 2014.
DOI : 10.1007/s00224-013-9448-1

H. Attiya, R. Guerraoui, D. Hendler, and P. Kuznetsov, The complexity of obstruction-free implementations, Journal of the ACM, vol.56, issue.4, 2009.
DOI : 10.1145/1538902.1538908

H. Buhrman, J. A. Garay, J. Hoepman, and M. Moir, Long-lived renaming made fast, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, pp.194-203, 1995.
DOI : 10.1145/224964.224986

C. Capdevielle, C. Johnen, P. Kuznetsov, and A. Milani, On the Uncontended Complexity of Anonymous Consensus, OPODIS 2015, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01411528

M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/3149.214121

R. Gelashvili, On the Optimal Space Complexity of Consensus for Anonymous Processes, DISC, 2015.
DOI : 10.1007/978-3-662-48653-5_30
URL : https://hal.archives-ouvertes.fr/hal-01207153

G. Giakkoupis, M. Helmi, L. Higham, and P. Woelfel, An $O(\sqrt n)$ Space Bound for Obstruction-Free Leader Election, Distributed Computing -27th International Symposium, DISC 2013. Proceedings, pp.46-60, 2013.
DOI : 10.1007/978-3-642-41527-2_4
URL : https://hal.archives-ouvertes.fr/hal-00875167

R. Guerraoui and E. Ruppert, Anonymous and fault-tolerant shared-memory computing, Distributed Computing, vol.34, issue.3, pp.165-177, 2007.
DOI : 10.1007/s00446-007-0042-0

V. Hadzilacos and S. Toueg, On deterministic abortable objects, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.4-12, 2013.
DOI : 10.1145/2484239.2484241

M. Herlihy, V. Luchangco, and M. Moir, Obstruction-free synchronization: double-ended queues as an example, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., pp.522-529, 2003.
DOI : 10.1109/ICDCS.2003.1203503

M. Herlihy and J. M. Wing, 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

L. Lamport, A fast mutual exclusion algorithm, ACM Transactions on Computer Systems, vol.5, issue.1, pp.1-11, 1987.
DOI : 10.1145/7351.7352

M. Loui and H. Abu-amara, Memory requirements for agreement among unreliable asynchronous processes, Advances in Computing Research, pp.163-183, 1987.

V. Luchangco, M. Moir, and N. Shavit, On the Uncontended Complexity of Consensus, Distributed Computing, pp.45-59, 2003.
DOI : 10.1007/978-3-540-39989-6_4

M. Moir and J. H. Anderson, Wait-free algorithms for fast, long-lived renaming, Science of Computer Programming, vol.25, issue.1, pp.1-39, 1995.
DOI : 10.1016/0167-6423(95)00009-H

L. Zhu, A tight space bound for consensus, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, 2016.
DOI : 10.1145/2897518.2897565