A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, 1983.

S. Alpern, Rendezvous Search: A Personal Perspective, Operations Research, vol.50, issue.5, pp.772-795, 2002.
DOI : 10.1287/opre.50.5.772.363

S. Alpern and S. Gal, The Theory of Search Games and Rendezvous, International Series in Operations Research & Management, 2003.

R. Baldoni, F. Bonnet, A. Milani, and M. Raynal, On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots, Proceedings of the 12th International Conference On Principles Of Distributed Systems (OPODIS), pp.428-445, 2008.
DOI : 10.1109/AINA.2007.44
URL : https://hal.archives-ouvertes.fr/inria-00277344

L. Blin, A. Milani, M. Potop-butucaru, and S. Tixeuil, Exclusive Perpetual Ring Exploration without Chirality, Proceedings of the 24th International Symposium on Distributed Computing (DISC), pp.312-327, 2010.
DOI : 10.1007/978-3-642-15763-9_29
URL : https://hal.archives-ouvertes.fr/hal-00992700

F. Bonnet, A. Milani, M. Potop-butucaru, and S. Tixeuil, Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction, Proceedings of the 15th International Conference On Principles Of Distributed Systems (OPODIS), pp.251-265, 2011.
DOI : 10.1007/978-3-642-25873-2_18
URL : https://hal.archives-ouvertes.fr/hal-00992679

S. Buss, Alogtime algorithms for tree isomorphism, comparison, and canonization, Lecture Notes in Computer Science, vol.1289, pp.18-33, 1997.
DOI : 10.1007/3-540-63385-5_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.9648

J. Czyzowicz, L. Gasieniec, and A. Pelc, Gathering few fat mobile robots in the plane, Theoretical Computer Science, vol.410, pp.6-7, 2009.

D. Angelo, G. , D. Stefano, G. Navarra, and A. , Gathering of six robots on anonymous symmetric rings, Proceedings of the 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.174-185, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00644039

D. Angelo, G. , D. Stefano, G. Navarra, and A. , Gathering of robots on anonymous grids without multiplicity detection, Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.327-338, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00728988

D. Angelo, G. , D. Stefano, G. Navarra, and A. , How to gather asynchronous oblivious robots on anonymous rings, Proceedings of the 26th International Symposium on Distributed Computing (DISC), pp.330-344, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00728979

S. Devismes, F. Petit, and S. Tixeuil, Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots, Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.195-208, 2009.
DOI : 10.1016/j.tcs.2008.04.042
URL : https://hal.archives-ouvertes.fr/hal-00930045

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Computing without communicating: Ring exploration by asynchronous oblivious robots. Algorithmica
DOI : 10.1007/978-3-540-77096-1_8
URL : https://hal.archives-ouvertes.fr/hal-00339884

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Remembering without memory: Tree exploration by asynchronous oblivious robots, Theoretical Computer Science, vol.411, pp.14-15, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00341465

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Gathering of asynchronous robots with limited visibility, Theoretical Computer Science, vol.337, issue.1-3, pp.147-168, 2005.
DOI : 10.1016/j.tcs.2005.01.001

K. Haba, T. Izumi, Y. Katayama, N. Inuzuka, and K. Wada, On gathering problem in a ring for 2n autonomous mobile robots, Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), p.poster, 2008.

T. Izumi, T. Izumi, S. Kamei, and F. Ooshita, Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings, Proceedings of the 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.101-113, 2010.
DOI : 10.1007/978-3-642-13284-1_9

S. Kamei, A. Lamani, F. Ooshita, and S. Tixeuil, Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection, Proceedings of the 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.150-161, 2011.
DOI : 10.1007/11429647_20
URL : https://hal.archives-ouvertes.fr/hal-01009454

S. Kamei, A. Lamani, F. Ooshita, and S. Tixeuil, Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection, Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp.542-553, 2012.
DOI : 10.1007/11429647_20
URL : https://hal.archives-ouvertes.fr/hal-01009454

B. Kempkes and F. Meyer-auf-der-heide, Continuous Local Strategies for Robotic Formation Problems, Proceedings of the 11th International Symposium on Experimental Algorithms (SEA), pp.9-17, 2012.
DOI : 10.1007/978-3-642-30850-5_2

R. Klasing, A. Kosowski, and A. Navarra, Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring, Theoretical Computer Science, vol.411, issue.34-36, pp.3235-3246, 2010.
DOI : 10.1016/j.tcs.2010.05.020
URL : https://hal.archives-ouvertes.fr/hal-00519069

R. Klasing, E. Markou, and A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Theoretical Computer Science, vol.390, issue.1, pp.27-39, 2008.
DOI : 10.1016/j.tcs.2007.09.032
URL : https://hal.archives-ouvertes.fr/hal-00307234

M. Koren, Gathering small number of mobile asynchronous robots on ring. Zeszyty Naukowe Wydzialu ETI Politechniki Gdanskiej, pp.325-331, 2010.

E. Kranakis, D. Krizanc, and E. Markou, The Mobile Agent Rendezvous Problem in the Ring, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010.
DOI : 10.2200/S00278ED1V01Y201004DCT001

E. Kranakis, D. Krizanc, and S. Rajsbaum, Mobile Agent Rendezvous: A Survey, Proceedings of the 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.1-9, 2006.
DOI : 10.1007/11780823_1

A. Pelc, Deterministic rendezvous in networks: A comprehensive survey, Networks, vol.7, issue.3, pp.331-347, 2012.
DOI : 10.1002/net.21453

G. Prencipe, Impossibility of gathering by a set of autonomous mobile robots, Theoretical Computer Science, vol.384, issue.2-3, pp.222-231, 2007.
DOI : 10.1016/j.tcs.2007.04.023

N. Santoro, Design and Analysis of Distributed Algorithms, 2007.
DOI : 10.1002/0470072644

I. Suzuki and M. Yamashita, Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.28, issue.4, pp.1347-1363, 1999.
DOI : 10.1137/S009753979628292X
URL : http://cc.ee.ntu.edu.tw/~ncslab/StudyGroup/MultiAgentFormation/SuYa9904FormationPatterns.pdf