B. Degener, B. Kempkes, T. Langner, F. Meyer-auf-der-heide, P. Pietrzyk et al., A tight runtime bound for synchronous gathering of autonomous robots with limited visibility, Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, SPAA '11, pp.139-148, 2011.
DOI : 10.1145/1989493.1989515

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

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

E. Bampas, J. Czyzowicz, L. Gasieniec, D. Ilcinkas, and A. Labourel, Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids, Proc. of the 24th Int. Symp. on Distributed Computing (DISC, pp.297-311, 2010.
DOI : 10.1007/978-3-642-15763-9_28
URL : https://hal.archives-ouvertes.fr/hal-00534263

A. Dessmark, P. Fraigniaud, D. Kowalski, and A. Pelc, Deterministic Rendezvous in Graphs, Algorithmica, vol.46, issue.1, pp.69-96, 2006.
DOI : 10.1007/s00453-006-0074-2

T. Izumi, T. Izumi, S. Kamei, and F. Ooshita, Randomized Gathering of Mobile Robots with Local-Multiplicity Detection, Proc. of the 11th Int. Symp. on Stabilization , Safety, and Security of Distributed Systems (SSS), pp.384-398, 2009.
DOI : 10.1007/978-3-642-05118-0_27

A. Cord-landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes et al., A New Approach for Analyzing Convergence Algorithms for Mobile Robots, Proc. of the 38th Int. Colloquium on Automata, languages and programming (ICALP, pp.650-661, 2011.
DOI : 10.1137/S009753979628292X

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

S. Alpern, The Rendezvous Search Problem, SIAM Journal on Control and Optimization, vol.33, issue.3, pp.673-683, 1995.
DOI : 10.1137/S0363012993249195

J. Chalopin and S. Das, Rendezvous of Mobile Agents without Agreement on Local Orientation, Proc. of the 37th Int. Colloquium on Automata, languages and programming (ICALP, pp.515-526, 2010.
DOI : 10.1007/978-3-642-14162-1_43
URL : https://hal.archives-ouvertes.fr/hal-01198883

J. Czyzowicz, A. Labourel, and A. Pelc, How to meet asynchronously (almost) everywhere, Proc. of the 21st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.22-30, 2010.
DOI : 10.1145/2344422.2344427
URL : https://hal.archives-ouvertes.fr/hal-00418775

L. Blin, A. Milani, M. Potop-butucaru, and S. Tixeuil, Exclusive Perpetual Ring Exploration without Chirality, Proc. of the 24th Int. Symp. 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

S. Devismes, F. Petit, and S. Tixeuil, Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots, Proc. of the 16th Int. 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
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, Theor. Comput. Sci, vol.411, pp.14-15, 2010.
DOI : 10.1016/j.tcs.2010.01.007
URL : https://hal.archives-ouvertes.fr/hal-00341465

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.411-3235, 2010.
DOI : 10.1016/j.tcs.2010.05.020
URL : https://hal.archives-ouvertes.fr/hal-00519069

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

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

T. Izumi, T. Izumi, S. Kamei, and F. Ooshita, Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings, Proc. of the 17th Int. 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, Proc. of the 18th Int. 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