N. Agmon and D. Peleg, Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots, SIAM Journal on Computing, vol.36, issue.1, pp.56-82, 2006.
DOI : 10.1137/050645221
URL : http://wisdomarchive.wisdom.weizmann.ac.il:81/archive/00000338/01/full03-06.pdf

M. Alcántara, A. Castañeda, D. Peñaloza, and S. Rajsbaum, Fault-tolerant robot gathering problems on graphs with arbitrary appearing times, IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, pp.2017-493, 2017.

H. Attiya, A. Bar-noy, and D. Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM, vol.42, issue.1, pp.124-142, 1995.
DOI : 10.1145/200836.200869
URL : http://www.dtic.mil/cgi-bin/GetTRDoc?AD=ADA219923&Location=U2&doc=GetTRDoc.pdf

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 J. Welch, Distributed computing: fundamentals, simulations, and advanced topics, 2004.
DOI : 10.1002/0471478210

S. Bhattacharya, D. Lipsky, R. Ghrist, and V. Kumar, Invariants for homology classes with application to optimal search and planning problem in robotics, Annals of Mathematics and Artificial Intelligence, vol.2, issue.5, pp.251-281, 2013.
DOI : 10.1007/BF00735431

O. Biran, S. Moran, and S. Zaks, A combinatorial characterization of the distributed 1-solvable tasks, Journal of Algorithms, vol.11, issue.3, pp.420-440, 1990.
DOI : 10.1016/0196-6774(90)90020-F

E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum, The BG distributed simulation algorithm, Distributed Computing, vol.14, issue.3, pp.127-146, 2001.
DOI : 10.1007/PL00008933
URL : http://theory.lcs.mit.edu/tds/papers/Borowsky/TM-573.pdf

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

Z. Bouzid, S. Das, and S. Tixeuil, Gathering of Mobile Robots Tolerating Multiple Crash Faults, 2013 IEEE 33rd International Conference on Distributed Computing Systems, pp.337-346, 2013.
DOI : 10.1109/ICDCS.2013.27
URL : https://hal.archives-ouvertes.fr/hal-00930074

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

A. Castañeda, S. Rajsbaum, and M. Raynal, The renaming problem in shared memory systems: An introduction, Computer Science Review, vol.5, issue.3, pp.229-251, 2011.
DOI : 10.1016/j.cosrev.2011.04.001

A. Castañeda, D. Imbs, S. Rajsbaum, and M. Raynal, Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects, SIAM Journal on Computing, vol.45, issue.2, pp.379-414, 2016.
DOI : 10.1137/130936828

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
URL : https://doi.org/10.1006/inco.1993.1043

S. Das, P. Flocchini, G. Prencipe, N. Santoro, and M. Yamashita, Autonomous mobile robots with lights, Theoretical Computer Science, vol.609, issue.P1, pp.171-184, 2016.
DOI : 10.1016/j.tcs.2015.09.018

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

M. Fischer, N. Lynch, and M. 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, Recursion in Distributed Computing, Proceedings of the 12th International Conference on Stabilization, Safety, and Security of Distributed Systems, SSS'10, pp.362-376, 2010.
DOI : 10.1109/13.865200

E. Gafni, S. Rajsbaum, and M. Herlihy, Subconsensus Tasks: Renaming Is Weaker Than Set Agreement, Proceedings of the 20th International Conference on Distributed Computing, DISC'06, pp.329-338, 2006.
DOI : 10.1007/11864219_23

M. 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. Herlihy, D. Kozlov, and S. Rajsbaum, Distributed computing through combinatorial topology, 2013.

M. Herlihy and S. Rajsbaum, The decidability of distributed decision tasks (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.589-598, 1997.
DOI : 10.1145/258533.258652

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

G. Hoest and N. Shavit, Toward a Topological Characterization of Asynchronous Complexity, SIAM Journal on Computing, vol.36, issue.2, pp.457-497, 2006.
DOI : 10.1137/S0097539701397412

X. Liu, Z. Xu, and J. Pan, Classifying rendezvous tasks of arbitrary dimension, Theoretical Computer Science, vol.410, issue.21-23, pp.21-232162, 2009.
DOI : 10.1016/j.tcs.2009.01.033

H. Mendes, M. Herlihy, N. Vaidya, and V. Garg, Multidimensional agreement in Byzantine systems, Distributed Computing, vol.1, issue.1, pp.423-441, 2015.
DOI : 10.1145/2484239.2484256

D. Portugal and R. Rocha, Retrieving topological information for mobile robots provided with grid maps, Number 358 in Communications in Computer and Information Science, 2013.

V. Saraph and M. Herlihy, The relative power of composite loop agreement tasks, Proceedings of the International Conference on Principles of Distributed systems (OPODIS), LIPIcs: Leibniz Int. Proc. Informatics