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

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

S. Alpern, Rendezvous search on labeled networks, Naval Research Logistics, vol.48, issue.3, pp.256-274, 2002.
DOI : 10.1002/nav.10011

S. Alpern and S. Gal, The theory of search games and rendezvous, Int. Series in Operations research and Management Science, 2002.

J. Alpern, V. Baston, and S. Essegaier, Rendezvous search on a graph, Journal of Applied Probability, vol.10, issue.01, pp.223-231, 1999.
DOI : 10.1137/S0363012993249195

E. Anderson and R. Weber, The rendezvous problem on discrete locations, Journal of Applied Probability, vol.27, issue.04, pp.839-851, 1990.
DOI : 10.2307/3214009

E. Anderson and S. Fekete, Asymmetric rendezvous on the plane, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.365-373, 1998.
DOI : 10.1145/276884.276925

E. Anderson and S. Fekete, Two Dimensional Rendezvous Search, Operations Research, vol.49, issue.1, pp.107-118, 2001.
DOI : 10.1287/opre.49.1.107.11191

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

V. Baston and S. Gal, Rendezvous search when marks are left at the starting points, Naval Research Logistics, vol.40, issue.8, pp.722-731, 2001.
DOI : 10.1002/nav.1044

J. Chalopin, S. Das, and A. Kosowski, Constructing a Map of an Anonymous Graph: Applications of Universal Sequences, Proc. 14th International Conference on Principles of Distributed Systems, pp.119-134, 2010.
DOI : 10.1007/3-540-61440-0_163
URL : https://hal.archives-ouvertes.fr/hal-00726071

M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro, Solving the Robots Gathering Problem, Proc. 30th International Colloquium on Automata, Languages and Programming, pp.1181-1196, 2003.
DOI : 10.1007/3-540-45061-0_90

R. Cohen and D. Peleg, Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems, SIAM Journal on Computing, vol.34, issue.6, pp.1516-1528, 2005.
DOI : 10.1137/S0097539704446475

R. Cohen and D. Peleg, Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements, SIAM Journal on Computing, vol.38, issue.1, pp.276-302, 2008.
DOI : 10.1137/060665257

J. Czyzowicz, A. Kosowski, and A. Pelc, How to meet when you forget, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.450-459, 2010.
DOI : 10.1145/1835698.1835801
URL : https://hal.archives-ouvertes.fr/hal-00725875

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

G. Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc et al., Asynchronous deterministic rendezvous in graphs, Theoretical Computer Science, vol.355, issue.3, pp.315-326, 2006.
DOI : 10.1016/j.tcs.2005.12.016

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

Y. Dieudonné, A. Pelc, and D. Peleg, Gathering despite mischief, Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, 2012.

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Gathering of Asynchronous Oblivious Robots with Limited Visibility, Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science, pp.247-258, 2001.
DOI : 10.1007/3-540-44693-1_22

P. Fraigniaud and A. Pelc, Deterministic Rendezvous in Trees with Little Memory, Proc. 22nd International Symposium on Distributed Computing, pp.242-256, 2008.
DOI : 10.1007/978-3-540-87779-0_17

P. Fraigniaud and A. Pelc, Delays induce an exponential memory gap for rendezvous in trees, Proc. 22nd Ann. ACM Symposium on Parallel Algorithms and Architectures, pp.224-232, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00922693

P. Fraigniaud and A. Pelc, Decidability classes for mobile agents computing, CoRR abs, 1011.

S. Gal, Rendezvous Search on the Line, Operations Research, vol.47, issue.6, pp.974-976, 1999.
DOI : 10.1287/opre.47.6.974

A. Israeli and M. Jalfon, Token management schemes and random walks yield self-stabilizing mutual exclusion, Proceedings of the ninth annual ACM symposium on Principles of distributed computing , PODC '90, pp.119-131, 1990.
DOI : 10.1145/93385.93409

D. Kowalski and A. Malinowski, How to meet in anonymous network, 13th Int. Colloquium on Structural Information and Comm, pp.44-58, 2006.

E. Kranakis, D. Krizanc, and P. Morin, Randomized Rendez-Vous with Limited Memory, Proc. 8th Latin American Theoretical Informatics, pp.605-616, 2008.
DOI : 10.1007/978-3-540-78773-0_52

E. Kranakis, D. Krizanc, N. Santoro, and C. Sawchuk, Mobile agent rendezvous in a ring, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., pp.592-599, 2003.
DOI : 10.1109/ICDCS.2003.1203510

W. Lim and S. Alpern, Minimax Rendezvous on the Line, SIAM Journal on Control and Optimization, vol.34, issue.5, pp.1650-1665, 1996.
DOI : 10.1137/S036301299427816X

N. A. Lynch, Distributed Algorithms, 1996.

A. Pelc, DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results, Proc. 25th International Symposium on Distributed Computing (DISC 2011), pp.1-15
DOI : 10.1109/71.481599

O. Reingold, Undirected connectivity in log-space, Journal of the ACM, vol.55, issue.4, 2008.
DOI : 10.1145/1391289.1391291

A. Ta-shma and U. Zwick, Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences, Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, pp.599-608, 2007.
DOI : 10.1145/2601068

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-89, 1996.
DOI : 10.1145/62546.62568

X. Yu and M. Yung, Agent rendezvous: A dynamic symmetry-breaking problem, Proc. International Colloquium on Automata, Languages, and Programming (ICALP 1996), Springer LNCS 1099, pp.610-621
DOI : 10.1007/3-540-61440-0_163