Y. Afek, E. Gafni, J. Tromp, and P. M. Vitányi, Wait-free test-and-set, Proc. of 6th WDAG, pp.85-94, 1992.
DOI : 10.1007/3-540-56188-9_6

D. Alistarh and J. Aspnes, Sub-logarithmic Test-and-Set against a Weak Adversary, Proc. of 25th DISC, pp.97-109, 2011.
DOI : 10.1007/s004460200071
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.604

D. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, Fast Randomized Test-and-Set and Renaming, Proc. of 24th DISC, pp.94-108, 2010.
DOI : 10.1007/978-3-642-15763-9_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.4986

J. Aspnes, A modular approach to shared-memory consensus, with applications to the probabilistic-write model, Proc. of 20th PODC, pp.460-467, 2010.

J. Aspnes, Faster randomized consensus with an oblivious adversary, Proc. of 31st PODC, 2012.
DOI : 10.1007/s00446-013-0195-y
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.1304

H. Attiya and K. Censor, Lower bounds for randomized consensus under a weak adversary, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.3885-3904, 2010.
DOI : 10.1145/1400751.1400793
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.4892

H. Attiya, F. Kuhn, C. G. Plaxton, M. Wattenhofer, and R. Wattenhofer, Efficient adaptive collect using randomization, Distributed Computing, vol.25, issue.1, pp.179-188, 2006.
DOI : 10.1007/s00446-005-0143-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.2565

J. E. Burns and N. A. Lynch, Bounds on Shared Memory for Mutual Exclusion, Information and Computation, vol.107, issue.2, pp.171-184, 1993.
DOI : 10.1006/inco.1993.1065

W. Eberly, L. Higham, and J. Warpechowska-gruca, Long-lived, fast, waitfree renaming with optimal name space and high throughput, Proc. of 12th DISC, pp.149-160, 1998.
DOI : 10.1007/BFb0056480

F. E. Fich, M. Herlihy, and N. Shavit, On the space complexity of randomized synchronization, Journal of the ACM, vol.45, issue.5, pp.843-862, 1998.
DOI : 10.1145/290179.290183

W. Golab, D. Hendler, and P. Woelfel, An $O(1)$ RMRs Leader Election Algorithm, SIAM Journal on Computing, vol.39, issue.7, pp.2726-2760, 2010.
DOI : 10.1137/070686445

M. Moir and J. H. Anderson, Fast, long-lived renaming, Proc. of 8th WDAG, pp.141-155, 1994.
DOI : 10.1007/BFb0020430

J. Tromp and P. M. Vitányi, Randomized two-process wait-free test-and-set, Distributed Computing, vol.15, issue.3, pp.127-135, 2002.
DOI : 10.1007/s004460200071

A. C. Yao, Probabilistic computations: Toward a unified measure of complexity, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.222-227, 1977.
DOI : 10.1109/SFCS.1977.24