H. Attiya, A. Bar-noy, and D. D. , Sharing memory robustly in message passing systems, Journal of the ACM, vol.42, issue.1, pp.121-132, 1995.

H. Attiya, A. Bar-noy, D. Dolev, D. Peleg, and R. R. , 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 J. Welch, Distributed computing: fundamentals, simulations, and advanced topics, 2004.
DOI : 10.1002/0471478210

E. Borowsky and E. Gafni, -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

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

E. Borowsky and E. Gafni, A simple algorithmically reasoned characterization of wait-free computations, Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC'97), pp.189-198, 1997.

A. Castañeda and S. Rajsbaum, New combinatorial topology bounds for renaming: the lower bound, Distributed Computing, vol.29, issue.5, pp.287-301, 2010.
DOI : 10.1007/s00446-010-0108-2

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

D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. W. , 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

T. E. Elrad and N. Francez, Decomposition of distributed programs into communication-closed layers, Science of Computer Programming, vol.2, issue.3, pp.155-173, 1982.
DOI : 10.1016/0167-6423(83)90013-8

M. J. Fischer, N. A. Lynch, and M. S. Paterson, 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

E. Gafni and S. Rajsbaum, Distributed Programming with Tasks, 14th Int'l Conference Principles of Distributed Systems (OPODIS'10), Sprionger LNCS 6490, pp.205-218, 2010.
DOI : 10.1137/S0097539796307698

M. P. 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. P. Herlihy and S. Rajsbaum, 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

M. P. Herlihy and S. Rajsbaum, The topology of shared-memory adversaries, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.105-113, 2010.
DOI : 10.1145/1835698.1835724

M. P. 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

D. Kozlov, Chromatic subdivision of a simplicial complex. Homology, Homotopy and Applications, pp.1-13, 2012.

M. C. Loui and H. H. Abu-amara, Memory requirements for agreement among unreliable asynchronous processes, of Adv. in Comp. Research, JAI Press, pp.163-183, 1987.

C. R. Maunder, Algebraic topology, 1990.

H. Mendes and M. P. Herlihy, Multidimensional approximate agreement in Byzantine asynchronous systems, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.391-400, 2013.
DOI : 10.1145/2488608.2488657