The Rendezvous Search Problem, SIAM Journal on Control and Optimization, vol.33, issue.3, pp.673-683, 1995. ,
DOI : 10.1137/S0363012993249195
Rendezvous search on labeled networks, Naval Research Logistics, vol.48, issue.3, pp.256-274, 2002. ,
DOI : 10.1002/nav.10011
The theory of search games and rendezvous, Int. Series in Operations research and Management Science, 2002. ,
Rendezvous search on a graph, Journal of Applied Probability, vol.10, issue.01, pp.223-231, 1999. ,
DOI : 10.1137/S0363012993249195
Tree exploration with logarithmic memory, ACM Transactions on Algorithms, vol.7, issue.2, 2011. ,
DOI : 10.1145/1921659.1921663
The rendezvous problem on discrete locations, Journal of Applied Probability, vol.28, pp.839-851, 1990. ,
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
Two Dimensional Rendezvous Search, Operations Research, vol.49, issue.1, pp.107-118, 2001. ,
DOI : 10.1287/opre.49.1.107.11191
Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees, Proc. 17th Int. Colloquium on Structural Information and Comm. ComplexitySIROCCO 2010), pp.86-100 ,
DOI : 10.1007/978-3-642-13284-1_8
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
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
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
How to meet when you forget, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.165-178, 2012. ,
DOI : 10.1145/1835698.1835801
URL : https://hal.archives-ouvertes.fr/hal-00725875
How to meet asynchronously (almost) everywhere, ACM Transactions on Algorithms, vol.8, issue.4, 2012. ,
DOI : 10.1145/2344422.2344427
URL : https://hal.archives-ouvertes.fr/hal-00418775
Asynchronous deterministic rendezvous in graphs, Theoretical Computer Science, vol.355, issue.3, pp.315-326, 2006. ,
DOI : 10.1016/j.tcs.2005.12.016
Deterministic Rendezvous in Graphs, Algorithmica, vol.46, issue.1, pp.69-96, 2006. ,
DOI : 10.1007/s00453-006-0074-2
Factorizing words over an ordered alphabet, Journal of Algorithms, vol.4, issue.4, pp.363-381, 1983. ,
DOI : 10.1016/0196-6774(83)90017-2
Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization, Proc. 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), pp.291-302 ,
DOI : 10.1007/978-3-642-31104-8_25
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
Deterministic Rendezvous in Trees with Little Memory, Proc. 22nd International Symposium on Distributed Computing (DISC 2008), pp.242-256 ,
DOI : 10.1007/978-3-540-87779-0_17
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
Delays induce an exponential memory gap for rendezvous in trees, ACM Transactions on Algorithms, vol.9, issue.2, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00922693
Rendezvous Search on the Line, Operations Research, vol.47, issue.6, pp.974-976, 1999. ,
DOI : 10.1287/opre.47.6.974
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
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
Randomized rendezvous with limited memory, ACM Transactions on Algorithms, vol.7, issue.3, 2011. ,
DOI : 10.1145/1978782.1978789
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
Minimax Rendezvous on the Line, SIAM Journal on Control and Optimization, vol.34, issue.5, pp.1650-1665, 1996. ,
DOI : 10.1137/S036301299427816X
Parallel Tree Contraction, Part 1: Fundamentals, Randomness and Computation, pp.47-72, 1989. ,
Deterministic rendezvous in networks: A comprehensive survey, Networks, vol.7, issue.3, pp.331-347, 2012. ,
DOI : 10.1002/net.21453
External Memory Algorithms for String Problems, Fundamenta Informaticae, vol.84, pp.17-32, 2008. ,
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.734
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
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