Wait-free test-and-set, Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG), pp.85-94, 1992. ,
Sub-logarithmic testand-set against a weak adversary, Proceedings of the 25th International Symposium on Distributed Computing (DISC), pp.97-109, 2011. ,
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. ,
The complexity of renaming, Proceedings of the 52nd IEEE Symposium on Foundations of Computer Science (FOCS), pp.718-727, 2011. ,
Fast randomized testand-set and renaming, Proceedings of the 24th International Symposium on Distributed Computing (DISC), pp.94-108, 2010. ,
Faster randomized consensus with an oblivious adversary, Proceedings of the 31st ACM Symposium on Principles of Distributed Computing (PODC), pp.1-8, 2012. ,
Lower bounds for randomized consensus under a weak adversary, SIAM Journal on Computing, vol.39, issue.8, pp.3885-3904, 2010. ,
Efficient adaptive collect using randomization, Distributed Computing, vol.18, issue.3, pp.179-188, 2006. ,
On the importance of having an identity or, is consensus really universal? Distributed Computing, vol.18, pp.167-176, 2006. ,
Analyzing randomized search heuristics: Tools from probability theory, Theory of Randomized Search Heuristics: Foundations and Recent Developments, pp.1-20, 2011. ,
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. ,
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
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
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
An O(1) RMRs leader election algorithm, SIAM Journal on Computing, vol.39, pp.2726-2760, 2010. ,
Algorithmic analysis of a basic evolutionary algorithm for continuous optimization, Theoretical Computer Science, vol.279, issue.3, pp.329-347, 2007. ,
Efficient synchronization on multiprocessors with shared memory, ACM Transactions on Programming Languages and Systems, vol.10, issue.4, pp.579-601, 1988. ,
Concentration, Probabilistic Methods for Algorithmic Discrete Mathematics, pp.195-248, 1998. ,
Fast, long-lived renaming, Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG), pp.141-155, 1994. ,
Randomized naming using wait-free shared variables, Distributed Computing, vol.11, issue.3, pp.113-124, 1998. ,
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. ,
Randomized waitfree test-and-set, 1990. ,
Randomized twoprocess wait-free test-and-set, Distributed Computing, vol.15, issue.3, pp.127-135, 2002. ,
Probabilistic computations: Towards a unified measure of complexity, Proceedings of the 17th IEEE Symposium on Foundations of Computer Science (FOCS), pp.222-227, 1977. ,