Affiliation:
1. Nara Institute of Science and Technology
2. Toyohashi University of Technology
Publisher
Institute of Electronics, Information and Communications Engineers (IEICE)
Subject
Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software
Reference22 articles.
1. [1] A. Pelc, “Deterministic rendezvous algorithms,” Distributed Computing by Mobile Entities, Current Research in Moving and Computing, ed. P. Flocchini, G. Prencipe, and N. Santoro, pp.423-454, Springer, 2019. 10.1007/978-3-030-11072-7_17
2. [2] Y. Dieudonné, A. Pelc, and D. Peleg, “Gathering Despite Mischief,” ACM Transactions on Algorithms, vol.11, no.1, pp.1-28, 2014. 10.1145/2629656
3. [3] S. Bouchard, Y. Dieudonné, and B. Ducourthial, “Byzantine gathering in networks,” Distributed Computing, vol.29, no.6, pp.435-457, 2016. 10.1007/s00446-016-0276-9
4. [4] S. Bouchard, Y. Dieudonné, and A. Lamani, “Byzantine gathering in polynomial time,” 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, pp.147:1-147:15, 2018.
5. [5] T. Schelling, The Strategy of Conflict, Harvard University Press, 1960.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast gathering despite a linear number of weakly Byzantine agents†;Concurrency and Computation: Practice and Experience;2024-04-03
2. Gathering despite a linear number of weakly Byzantine agents;2022 Tenth International Symposium on Computing and Networking Workshops (CANDARW);2022-11
3. Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20