Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990. ,
DOI : 10.1145/79147.79158
The Combinatorial Structure of Wait-Free Solvable Tasks, SIAM Journal on Computing, vol.31, issue.4, pp.1286-1313, 2002. ,
DOI : 10.1137/S0097539797330689
-resilient asynchronous computations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.91-100, 1993. ,
DOI : 10.1145/167088.167119
URL : https://hal.archives-ouvertes.fr/hal-00896459
Immediate atomic snapshots and fast renaming, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing , PODC '93, pp.41-51, 1993. ,
DOI : 10.1145/164051.164056
A simple algorithmically reasoned characterization of wait-free computation (extended abstract), Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing , PODC '97, pp.189-198, 1997. ,
DOI : 10.1145/259380.259439
An Equivariance Theorem with Applications to Renaming, 2011. ,
New combinatorial topology upper and lower bounds for renaming, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.295-304, 2008. ,
DOI : 10.1145/1400751.1400791
The renaming problem in shared memory systems: An introduction, Computer Science Review, vol.5, issue.3, 2011. ,
DOI : 10.1016/j.cosrev.2011.04.001
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993. ,
DOI : 10.1006/inco.1993.1043
Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract), 10th Int'l Workshop on Distributed Algorithms (WDAG'96), pp.362-379, 1996. ,
Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985. ,
DOI : 10.1145/3149.214121
Renaming with k-Set-Consensus: An Optimal Algorithm into n + k ??? 1 Slots, Proc. 10th Int'l Conference On Principles Of Distributed Systems (OPODIS'06), Springer Verlag LNCS #4305, pp.36-44, 2006. ,
DOI : 10.1007/11945529_4
The 01-Exclusion Families of Tasks, Proc. 12th In'l Conference on Principles of Distributed Systems (OPODIS'08), pp.246-258, 2008. ,
N-Consensus is the Second Strongest Object for N???+???1 Processes, Proc. 11th Int'l Conference On Principle Of Distributed Systems (OPODIS'07), pp.260-273, 2007. ,
DOI : 10.1007/978-3-540-77096-1_19
From adaptive renaming to set agreement, Theoretical Computer Science, vol.410, issue.14, pp.14-151328, 2009. ,
DOI : 10.1016/j.tcs.2008.05.016
URL : https://hal.archives-ouvertes.fr/hal-00432970
Distributed Programming with Tasks, Proc. 10th In'l Conference on Principles of Distributed Systems (OPODIS'10), pp.205-218, 2010. ,
DOI : 10.1137/S0097539796307698
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement, Proc. 20th Int'l Symposium on Distributed Computing (DISC'06), pp.329-338, 2006. ,
DOI : 10.1007/11864219_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.4954
From adaptive renaming to set agreement, Proc. 26th Int'l IEEE Symposium on Reliable Distributed Systems, pp.93-102, 2007. ,
DOI : 10.1016/j.tcs.2008.05.016
URL : https://hal.archives-ouvertes.fr/hal-00432970
Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991. ,
DOI : 10.1145/114005.102808
Set consensus using arbitrary objects (preliminary version), Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing , PODC '94, pp.324-333, 1994. ,
DOI : 10.1145/197917.198119
A classification of wait-free loop agreement tasks, Theoretical Computer Science, vol.291, issue.1, pp.55-77, 2003. ,
DOI : 10.1016/S0304-3975(01)00396-6
The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999. ,
DOI : 10.1145/331524.331529
The Universe of Symmetry Breaking Tasks, Rennes, vol.1, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00560453
Exploring Gafni???s Reduction Land: From ?? k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement, Proc. 20th Int'l Symposium on Distributed Computing (DISC'09), pp.1-15, 2006. ,
DOI : 10.1007/11864219_1
Iterated Shared Memory Models, Proc. 9th Latin American Symposium on Theoretical Informatics (LATIN'10), pp.407-416, 2010. ,
DOI : 10.1007/978-3-642-12200-2_36
-set agreement is impossible, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.1449-1483, 2000. ,
DOI : 10.1145/167088.167122
URL : https://hal.archives-ouvertes.fr/hal-00192526