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

C. [. Capdevielle, P. Johnen, A. Kuznetsov, and . Milani, On the uncontended complexity of anonymous consensus
URL : https://hal.archives-ouvertes.fr/hal-01411528

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. Luchangco, M. Moir, and N. Shavit, On the Uncontended Complexity of Consensus, 17th International Symposium on Distributed Computing, pp.45-59, 2003.
DOI : 10.1007/978-3-540-39989-6_4