Y. Afek, E. Gafni, J. Tromp, and P. M. Vitányi, Wait-free test-and-set, Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG), pp.85-94, 1992.

D. Alistarh and J. Aspnes, Sub-logarithmic testand-set against a weak adversary, Proceedings of the 25th International Symposium on Distributed Computing (DISC), pp.97-109, 2011.

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 ACM Symposium on Principles of Distributed Computing (PODC), pp.239-248, 2011.

D. Alistarh, J. Aspnes, S. Gilbert, and R. Guerraoui, The complexity of renaming, Proceedings of the 52nd IEEE Symposium on Foundations of Computer Science (FOCS), pp.718-727, 2011.

D. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, Fast randomized testand-set and renaming, Proceedings of the 24th International Symposium on Distributed Computing (DISC), pp.94-108, 2010.

J. Aspnes, Faster randomized consensus with an oblivious adversary, Proceedings of the 31st ACM Symposium on Principles of Distributed Computing (PODC), pp.1-8, 2012.

H. Attiya and K. Censor-hillel, Lower bounds for randomized consensus under a weak adversary, SIAM Journal on Computing, vol.39, issue.8, pp.3885-3904, 2010.

H. Attiya, F. Kuhn, C. Greg-plaxton, M. Wattenhofer, and R. Wattenhofer, Efficient adaptive collect using randomization, Distributed Computing, vol.18, issue.3, pp.179-188, 2006.

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

B. Doerr, Analyzing randomized search heuristics: Tools from probability theory, Theory of Randomized Search Heuristics: Foundations and Recent Developments, pp.1-20, 2011.

W. Eberly, L. Higham, and J. Warpechowskagruca, 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.

G. Giakkoupis, M. Helmi, L. Higham, and P. Woelfel, An O( ? n) space bound for obstructionfree leader election, Proceedings of the 27th International Symposium on Distributed Computing (DISC), pp.46-60, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00875167

G. Giakkoupis, M. Helmi, L. Higham, and P. Woelfel, Test-and-set in optimal space, Proceedings of the 47th ACM Symposium on Theory of Computing (STOC), pp.615-623, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01250520

G. Giakkoupis and P. Woelfel, On the time and space complexity of randomized test-and-set, Proceedings of the 31st ACM Symposium on Principles of Distributed Computing (PODC), pp.19-28, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00722947

W. Golab, D. Hendler, and P. Woelfel, An O(1) RMRs leader election algorithm, SIAM Journal on Computing, vol.39, pp.2726-2760, 2010.

J. Jägersküpper, Algorithmic analysis of a basic evolutionary algorithm for continuous optimization, Theoretical Computer Science, vol.279, issue.3, pp.329-347, 2007.

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

C. Mcdiarmid, Concentration, Probabilistic Methods for Algorithmic Discrete Mathematics, pp.195-248, 1998.

M. Moir and J. H. Anderson, Fast, long-lived renaming, Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG), pp.141-155, 1994.

A. Panconesi, M. Papatriantafilou, P. Tsigas, and P. M. Vitányi, Randomized naming using wait-free shared variables, Distributed Computing, vol.11, issue.3, pp.113-124, 1998.

E. Styer and G. L. Peterson, Tight bounds for shared memory symmetric mutual exclusion problems, Proceedings of the 8th ACM Symposium on Principles of Distributed Computing (PODC), pp.177-192, 1989.

J. Tromp, M. B. Paul, and . Vitányi, Randomized waitfree test-and-set, 1990.

J. Tromp, M. B. Paul, and . Vitányi, Randomized twoprocess wait-free test-and-set, Distributed Computing, vol.15, issue.3, pp.127-135, 2002.

A. Yao, Probabilistic computations: Towards a unified measure of complexity, Proceedings of the 17th IEEE Symposium on Foundations of Computer Science (FOCS), pp.222-227, 1977.