. Vitányi, Wait-free test-and-set, Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG), pp.85-94, 1992.

Z. Aghazadeh and P. Woelfel, Space- and Time-Efficient Long-Lived Test-And-Set Objects, Proceedings of the 18th International Conference on Principles of Distributed Computing (OPODIS), pp.404-419, 2014.
DOI : 10.1007/978-3-319-14472-6_27

D. Alistarh and J. Aspnes, Sub-logarithmic Test-and-Set against a Weak Adversary, Proceedings of the 25th International Symposium on Distributed Computing (DISC), pp.97-109, 2011.
DOI : 10.1007/s004460200071

D. Alistarh, J. Aspnes, K. Censor-hillel, S. Gilbert, and M. Zadimoghaddam, Optimal-time adaptive strong renaming, with applications to counting, Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '11, pp.239-248, 2011.
DOI : 10.1145/1993806.1993850

D. Alistarh, J. Aspnes, S. Gilbert, and R. Guerraoui, The Complexity of Renaming, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.718-727, 2011.
DOI : 10.1109/FOCS.2011.66

D. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, Fast Randomized Test-and-Set and Renaming, Proceedings of the 24th International Symposium on Distributed Computing (DISC), pp.94-108, 2010.
DOI : 10.1007/978-3-642-15763-9_9

H. Buhrman, A. Panconesi, R. Silvestri, and P. Vitányi, On the importance of having an identity or, is consensus really universal? Distributed Computing, pp.167-176, 2006.

J. Burns and N. 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, Proceedings of the 12th International Symposium on Distributed Computing (DISC), pp.149-160, 1998.
DOI : 10.1007/BFb0056480

F. E. Fich, V. Luchangco, M. Moir, and N. Shavit, Obstruction-Free Algorithms Can Be Practically Wait-Free, Proceedings of the 19th International Symposium on Distributed Computing (DISC), pp.78-92, 2005.
DOI : 10.1007/11561927_8

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

G. Giakkoupis and P. Woelfel, On the time and space complexity of randomized test-and-set, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.19-28
DOI : 10.1145/2332432.2332436
URL : https://hal.archives-ouvertes.fr/hal-00722947

G. Giakkoupis and P. Woelfel, A tight RMR lower bound for randomized mutual exclusion, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.983-1002, 2012.
DOI : 10.1145/2213977.2214066
URL : https://hal.archives-ouvertes.fr/hal-00722940

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

R. Guerraoui, M. Herlihy, and B. Pochon, Toward a theory of transactional contention managers, Proceedings of the 24th SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp.258-264, 2005.

M. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991.
DOI : 10.1145/114005.102808

M. Herlihy, V. Luchangco, and M. Moir, Obstruction-free synchronization: Double-ended queues as an example Time and space lower bounds for nonblocking implementations, Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS), pp.522-529438, 2000.

C. Kruskal, L. Rudolph, and M. Snir, Efficient synchronization of multiprocessors with shared memory, ACM Transactions on Programming Languages and Systems, vol.10, issue.4, pp.579-601, 1988.
DOI : 10.1145/48022.48024

A. Panconesi, M. Papatriantafilou, P. Tsigas, and P. M. Vitányi, Randomized naming using wait-free shared variables, Distributed Computing, pp.113-124, 1998.
DOI : 10.1007/s004460050045
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.6861

E. Styer and G. Peterson, Tight bounds for shared memory symmetric mutual exclusion problems, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing , PODC '89, pp.177-191, 1989.
DOI : 10.1145/72981.72993

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