Author:
Chalopin Jérémie,Das Shantanu
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer, Dordrecht (2003)
2. Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Symposium on Theory of Computing (STOC 1980), pp. 82–93 (1980)
3. Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: characterizations. In: Proc. 4th Israeli Symp. on Theory of Computing and Systems (ISTCS 1996), pp. 16–26 (1996)
4. Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Can we elect if we cannot compare? In: Proc. 15th Symp. on Parallel Algorithms and Architectures (SPAA), pp. 324–332 (2003)
5. Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Naval Research Logistics 48(8), 722–731 (2001)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献