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

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

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

J. Chalopin and S. Das, Rendezvous of Mobile Agents without Agreement on Local Orientation, Proc. of the 37th Int. Conf. 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

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. Conf. on Automata, Languages and Programming (ICALP), pp.650-661, 2011.
DOI : 10.1137/S009753979628292X

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

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

G. D. Angelo, G. D. Stefano, and A. Navarra, 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

G. D. Angelo, G. D. Stefano, and A. Navarra, How to gather asynchronous oblivious robots on anonymous rings
URL : https://hal.archives-ouvertes.fr/hal-00728979

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

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.4981

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-151583, 2010.
DOI : 10.1016/j.tcs.2010.01.007
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

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

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, Proc. of the 18th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.150-161, 2011.
DOI : 10.1007/978-3-642-22212-2_14
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, 2012.
DOI : 10.1007/11429647_20
URL : https://hal.archives-ouvertes.fr/hal-01009454

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.

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

M. Yamashita, S. Souissi, and X. Défago, Gathering two stateless mobile robots using very inaccurate compasses in finite time, Proc. of the 1st int. Conf. on Robot communication and coordination (RoboComm), pp.1-48, 2007.
DOI : 10.4108/icst.robocomm2007.2199