@article{oai:naist.repo.nii.ac.jp:00004152,
 author = {Tsuchida, Masashi and Ooshita, Fukuhito and Inoue, Michiko},
 issue = {3},
 journal = {IEICE Transactions on Information and Systems},
 month = {Mar},
 note = {We propose an algorithm for the gathering problem of mobile agents in arbitrary networks (graphs) with Byzantine agents. Our algorithm can make all correct agents meet at a single node in O(fm) time (f is the upper bound of the number of Byzantine agents and m is the number of edges) under the assumption that agents have unique ID and behave synchronously, each node is equipped with an authenticated whiteboard, and f is known to agents. Here, the whiteboard is a node memory where agents can leave information. Since the existing algorithm achieves gathering without a whiteboard in O(n9λ) time, where n is the number of nodes and λ is the length of the longest ID, our algorithm shows an authenticated whiteboard can significantly reduce the time for the gathering problem in Byzantine environments.},
 pages = {602--610},
 title = {Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards},
 volume = {E101.D},
 year = {2018}
}