{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T15:22:12Z","timestamp":1773415332634,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,1,5]]},"DOI":"10.1145\/3427796.3427799","type":"proceedings-article","created":{"date-parts":[[2020,12,25]],"date-time":"2020-12-25T22:25:45Z","timestamp":1608935145000},"page":"26-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Gathering with a strong team in weakly Byzantine environments"],"prefix":"10.1145","author":[{"given":"Jion","family":"Hirose","sequence":"first","affiliation":[{"name":"Nara Institute of Science and Technology, JP"}]},{"given":"Junya","family":"Nakamura","sequence":"additional","affiliation":[{"name":"Toyohashi University of Technology, JP"}]},{"given":"Fukuhito","family":"Ooshita","sequence":"additional","affiliation":[{"name":"Nara Institute of Science and Technology, JP"}]},{"given":"Michiko","family":"Inoue","sequence":"additional","affiliation":[{"name":"Nara Institute of Science and Technology, JP"}]}],"member":"320","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Evangelos Bampas Jurek Czyzowicz Leszek Gasieniec David Ilcinkas and Arnaud Labourel. 2010. Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. In DISC. 297\u2013311.  Evangelos Bampas Jurek Czyzowicz Leszek Gasieniec David Ilcinkas and Arnaud Labourel. 2010. Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. In DISC. 297\u2013311.","DOI":"10.1007\/978-3-642-15763-9_28"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0276-9"},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Byzantine Gathering in Polynomial Time","volume":"147","author":"Bouchard S\u00e9bastien","year":"2018","unstructured":"S\u00e9bastien Bouchard , Yoann Dieudonn\u00e9 , and Anissa Lamani . 2018 . Byzantine Gathering in Polynomial Time . In ICALP. 147 : 1 \u2013 147 :15. S\u00e9bastien Bouchard, Yoann Dieudonn\u00e9, and Anissa Lamani. 2018. Byzantine Gathering in Polynomial Time. In ICALP. 147:1\u2013147:15.","journal-title":"ICALP."},{"key":"e_1_3_2_1_4_1","volume-title":"Tell Me Where I Am So I Can Meet You Sooner. In ICALP. 502\u2013514","author":"Collins Andrew","year":"2010","unstructured":"Andrew Collins , Jurek Czyzowicz , Leszek Gasieniec , and Arnaud Labourel . 2010 . Tell Me Where I Am So I Can Meet You Sooner. In ICALP. 502\u2013514 . Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, and Arnaud Labourel. 2010. Tell Me Where I Am So I Can Meet You Sooner. In ICALP. 502\u2013514."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0141-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344422.2344427"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118736.3118835"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594581"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/130931990"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Pierre Fraigniaud and Andrzej Pelc. 2008. Deterministic Rendezvous in Trees with Little Memory. In DISC. 242\u2013256.  Pierre Fraigniaud and Andrzej Pelc. 2008. Deterministic Rendezvous in Trees with Little Memory. In DISC. 242\u2013256.","DOI":"10.1007\/978-3-540-87779-0_17"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2438645.2438649"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2846458.2846514"},{"key":"e_1_3_2_1_13_1","unstructured":"Jion Hirose Junya Nakamura Fukuhito Ooshita and Michiko Inoue. 2020. Gathering with a strong team in weakly Byzantine environments. (2020). arxiv:2007.08217\u00a0[cs.DC]  Jion Hirose Junya Nakamura Fukuhito Ooshita and Michiko Inoue. 2020. Gathering with a strong team in weakly Byzantine environments. (2020). arxiv:2007.08217\u00a0[cs.DC]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.010"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Evangelos Kranakis Danny Krizanc Euripides Markou Aris Pagourtzis and Felipe Ram\u00edrez. 2017. Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. In SOFSEM. 79\u201390.  Evangelos Kranakis Danny Krizanc Euripides Markou Aris Pagourtzis and Felipe Ram\u00edrez. 2017. Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. In SOFSEM. 79\u201390.","DOI":"10.1007\/978-3-319-51963-0_7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.016"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-015-0253-8"},{"key":"e_1_3_2_1_18_1","volume-title":"Fast Byzantine Gathering with Visibility in Graphs","author":"Miller Avery","unstructured":"Avery Miller and Ullash Saha . 2020. Fast Byzantine Gathering with Visibility in Graphs . In ALGOSENSORS. Springer . Avery Miller and Ullash Saha. 2020. Fast Byzantine Gathering with Visibility in Graphs. In ALGOSENSORS. Springer."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Andrzej Pelc. 2019. Deterministic Rendezvous Algorithms. In Distributed Computing by Mobile Entities Current Research in Moving and Computing Paola Flocchini Giuseppe Prencipe and Nicola Santoro(Eds.). 423\u2013454.  Andrzej Pelc. 2019. Deterministic Rendezvous Algorithms. In Distributed Computing by Mobile Entities Current Research in Moving and Computing Paola Flocchini Giuseppe Prencipe and Nicola Santoro(Eds.). 423\u2013454.","DOI":"10.1007\/978-3-030-11072-7_17"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"},{"key":"e_1_3_2_1_21_1","volume-title":"The Strategy of Conflict","author":"Schelling T.C.","unstructured":"T.C. Schelling . 1960. The Strategy of Conflict . Harvard University Press . T.C. Schelling. 1960. The Strategy of Conflict. Harvard University Press."},{"key":"e_1_3_2_1_22_1","unstructured":"Amnon Ta-Shma and Uri Zwick. 2007. Deterministic rendezvous treasure hunts and strongly universal exploration sequences. In SODA. 599\u2013608.  Amnon Ta-Shma and Uri Zwick. 2007. Deterministic rendezvous treasure hunts and strongly universal exploration sequences. In SODA. 599\u2013608."},{"key":"e_1_3_2_1_23_1","volume-title":"Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards. IEICE Transactions 101-D, 3","author":"Tsuchida Masashi","year":"2018","unstructured":"Masashi Tsuchida , Fukuhito Ooshita , and Michiko Inoue . 2018. Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards. IEICE Transactions 101-D, 3 ( 2018 ), 602\u2013610. Masashi Tsuchida, Fukuhito Ooshita, and Michiko Inoue. 2018. Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards. IEICE Transactions 101-D, 3 (2018), 602\u2013610."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Masashi Tsuchida Fukuhito Ooshita and Michiko Inoue. 2018. Gathering of Mobile Agents in Asynchronous Byzantine Environments with Authenticated Whiteboards. In NETYS. 85\u201399.  Masashi Tsuchida Fukuhito Ooshita and Michiko Inoue. 2018. Gathering of Mobile Agents in Asynchronous Byzantine Environments with Authenticated Whiteboards. In NETYS. 85\u201399.","DOI":"10.1007\/978-3-030-05529-5_6"}],"event":{"name":"ICDCN '21: International Conference on Distributed Computing and Networking 2021","location":"Nara Japan","acronym":"ICDCN '21"},"container-title":["Proceedings of the 22nd International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427796.3427799","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3427796.3427799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:31Z","timestamp":1750197751000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427796.3427799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,5]]},"references-count":24,"alternative-id":["10.1145\/3427796.3427799","10.1145\/3427796"],"URL":"https:\/\/doi.org\/10.1145\/3427796.3427799","relation":{},"subject":[],"published":{"date-parts":[[2021,1,5]]},"assertion":[{"value":"2021-01-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}