1. [1] M. Tsuchida, F. Ooshita, and M. Inoue, “Byzantine gathering in networks with authenticated whiteboards,” The 11th International Conference and Workshops on Algorithms and Computation, 2017.
2. [2] J. Cao and S.K. Das, Mobile agents in networking and distributed computing, Wiley-Interscience, 2012.
3. [3] A. Dessmark, P. Fraigniaud, D.R. Kowalski, and A. Pelc, “Deterministic rendezvous in graphs,” Algorithmica, vol.46, no.1, pp.69-96, 2006. 10.1007/s00453-006-0074-2
4. [4] D.R. Kowalski and A. Malinowski, “How to meet in anonymous network,” International Colloquium on Structural Information and Communication Complexity, Lecture Notes in Computer Science, vol.4056, pp.44-58, Springer, Berlin, Heidelberg, 2006. 10.1007/11780823_5
5. [5] A. Ta-Shma and U. Zwick, “Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences,” ACM Trans. Algorithms (TALG), vol.10, no.3, Article No.12, 2014. 10.1145/2601068