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, R. Guerraoui, and C. Travers, Early deciding synchronous renaming in O(log f ) rounds or less
URL : https://hal.archives-ouvertes.fr/hal-00687555

H. Attiya, A. Bar-noy, D. Dolev, D. Peleg, and R. Reischuk, Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990.
DOI : 10.1145/79147.79158

H. Attiya and T. Djerassi, Time bounds for decision problems in the presence of timing uncertainty and failures, Journal of Parallel and Distributed Computing, issue.8, pp.611096-1109, 2001.

H. Attiya and A. Fouren, Adaptive and Efficient Algorithms for Lattice Agreement and Renaming, SIAM Journal on Computing, vol.31, issue.2, pp.642-664, 2001.
DOI : 10.1137/S0097539700366000

E. Borowsky and E. Gafni, 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. Brodsky, F. Ellen, and P. Woelfel, Fully-adaptive algorithms for long-lived renaming, Distributed Computing, vol.25, issue.1, pp.119-134, 2011.
DOI : 10.1007/s00446-011-0137-5

E. James, G. L. Burns, and . Peterson, The ambiguity of choosing, PODC '89: Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, pp.145-157, 1989.

A. Castañeda and S. Rajsbaum, New combinatorial topology bounds for renaming, Journal of the ACM, vol.59, issue.1, 2012.
DOI : 10.1145/2108242.2108245

A. Castañeda and S. Rajsbaum, New combinatorial topology bounds for renaming, Journal of the ACM, vol.59, issue.1, pp.287-301, 2010.
DOI : 10.1145/2108242.2108245

S. Chaudhuri, 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

S. Chaudhuri, M. Herlihy, and M. R. Tuttle, Wait-free implementations in message-passing systems, Theoretical Computer Science, vol.220, issue.1, pp.211-245, 1999.
DOI : 10.1016/S0304-3975(98)00242-4

D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. E. Weihl, Reaching approximate agreement in the presence of faults, Journal of the ACM, vol.33, issue.3, pp.499-516, 1986.
DOI : 10.1145/5925.5931

D. Dolev, R. Reischuk, and H. R. Strong, Early stopping in Byzantine agreement, Journal of the ACM, vol.37, issue.4, pp.720-741, 1990.
DOI : 10.1145/96559.96565

E. Gafni, R. Guerraoui, and B. Pochon, The Complexity of Early Deciding Set Agreement, SIAM Journal on Computing, vol.40, issue.1, pp.63-78, 2011.
DOI : 10.1137/050640746

M. Herlihy and N. Shavit, The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999.
DOI : 10.1145/331524.331529

M. Moir and J. H. Anderson, Fast, long-lived renaming (extended abstract), WDAG '94: Proceedings of the 8th International Workshop on Distributed Algorithms, pp.141-155, 1994.
DOI : 10.1007/bfb0020430

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.3411

M. Okun, Strong order-preserving renaming in the synchronous message passing model, Theoretical Computer Science, vol.411, issue.40-42, pp.40-423787, 2010.
DOI : 10.1016/j.tcs.2010.06.001

M. Pease, R. Shostak, and L. Lamport, Reaching Agreement in the Presence of Faults, Journal of the ACM, vol.27, issue.2, pp.228-234, 1980.
DOI : 10.1145/322186.322188