R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.218-223
DOI : 10.1109/SFCS.1979.34

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, number 55, 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.28, pp.839-851, 1990.

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

V. Baston and S. Gal, Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution, SIAM Journal on Control and Optimization, vol.36, issue.6, pp.1880-1889, 1998.
DOI : 10.1137/S0363012996314130

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

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

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

D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, Random walks on weighted graphs, and applications to on-line algorithms, Proc. 22nd Annual ACM Symposium on Theory of Computing, pp.369-378, 1990.

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

M. Dyer, A. Frieze, and R. Kannan, A random polynomial time algorithm for estimating volumes of convex bodies, Proc. 21st Annual ACM Symposium on Theory of Computing (STOC'1989), pp.375-381

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 STACS'2001, pp.247-258
DOI : 10.1007/3-540-44693-1_22

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
DOI : 10.1145/93385.93409

R. Klasing, A. Kosowski, and A. Navarra, Taking advantage of symmetries: gathering of asynchronous oblivious robots on a ring, Proc. 12th International Conference on Principles of Distributed Systems, pp.446-462, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00342931

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

D. Kowalski and A. Malinowski, How to meet in anonymous network, Theoretical Computer Science, vol.399, issue.1-2, pp.141-156, 2008.
DOI : 10.1016/j.tcs.2008.02.010

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

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

T. Schelling, The strategy of conflict, 1960.

G. Stachowiak, Asynchronous Deterministic Rendezvous on the??Line, SOFSEM, vol.43, pp.497-508
DOI : 10.1007/3-540-61440-0_163

L. Thomas, Finding Your Kids When They Are Lost, Journal of the Operational Research Society, vol.43, issue.6, pp.637-639, 1992.
DOI : 10.1057/jors.1992.89

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

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