Author:
Chalopin Jérémie,Das Shantanu,Widmayer Peter
Reference25 articles.
1. 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. In Proc. of 20th Annual Symposium on Foundations of Computer Science (FOCS), pp. 218–223, 1979.
2. S. Alpern. Hide and seek games. Seminar, Institut fur Hohere Studien, Wien, July 1976.
3. S. Alpern and S. Gal. The Theory of Search Games and Rendezvous. Kluwer, 2003.
4. E. Bampas, J. Czyzowicz, L. Gasieniec, D. Ilcinkas, A. Labourel. Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. In Proc. 24th International Symposium on Distributed Computing (DISC), pp. 297–311, 2010.
5. P. Boldi, B. Codenotti, P. Gemmell, S. Shammah, J. Simon, and S. Vigna. Symmetry breaking in anonymous networks: Characterizations. In Proc. 4th Israeli Symposium on Theory of Computing and Systems, pp. 16–26, 1996.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献