{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T01:46:43Z","timestamp":1782697603455,"version":"3.54.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Research Chair in Distributed Computing at the Universit\u00b4e du Qu\u00b4ebec en Outaouais"},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["2022YRB97K"],"award-info":[{"award-number":["2022YRB97K"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSERC discovery grant","award":["RGPIN-2024-03767"],"award-info":[{"award-number":["RGPIN-2024-03767"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00446-025-00495-7","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T08:53:19Z","timestamp":1774255999000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Gathering teams of bounded memory agents on a line"],"prefix":"10.1007","volume":"39","author":[{"given":"Younan","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,23]]},"reference":[{"key":"495_CR1","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science, Kluwer Academic Publisher (2002)"},{"key":"495_CR2","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2013.01.022","volume":"478","author":"D Baba","year":"2013","unstructured":"Baba, D., Izumi, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Linear time and space gathering of anonymous mobile agents in asynchronous trees. Theoret. Comput. Sci. 478, 118\u2013126 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"495_CR3","doi-asserted-by":"crossref","unstructured":"Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids, Proc. 24th International Symposium on Distributed Computing (DISC), pp. 297\u2013311 (2010)","DOI":"10.1007\/978-3-642-15763-9_28"},{"key":"495_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00446-018-0338-2","volume":"32","author":"S Bouchard","year":"2019","unstructured":"Bouchard, S., Bournat, M., Dieudonn\u00e9, Y., Dubois, S., Petit, F.: Asynchronous approach in the plane: a deterministic polynomial algorithm. Distrib. Comput. 32, 317\u2013337 (2019)","journal-title":"Distrib. Comput."},{"key":"495_CR5","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s00446-016-0276-9","volume":"29","author":"S Bouchard","year":"2016","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Ducourthial, B.: Byzantine gathering in networks. Distrib. Comput. 29, 435\u2013457 (2016)","journal-title":"Distrib. Comput."},{"key":"495_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-022-00419-9","volume":"35","author":"S Bouchard","year":"2022","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Lamani, A.: Byzantine gathering in polynomial time. Distrib. Comput. 35, 235\u2013263 (2022)","journal-title":"Distrib. Comput."},{"key":"495_CR7","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: Gathering. SIAM J. Comput. 41, 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"key":"495_CR8","doi-asserted-by":"crossref","unstructured":"Collins, A., Czyzowicz, J., Gasieniec, L., Kosowski, A., Martin, R.A.: Synchronous rendezvous for location-aware agents. In: Proc. 25th International Symposium on Distributed Computing (DISC), 447-459 (2011)","DOI":"10.1007\/978-3-642-24100-0_42"},{"key":"495_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-011-0141-9","volume":"25","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: Log-space rendezvous in arbitrary graphs. Distrib. Comput. 25, 165\u2013178 (2012)","journal-title":"Distrib. Comput."},{"key":"495_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"495_CR11","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/130931990","volume":"44","author":"Y Dieudonn\u00e9","year":"2015","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44, 844\u2013867 (2015)","journal-title":"SIAM J. Comput."},{"key":"495_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337, 147\u2013168 (2005)","journal-title":"Theoretical Computer Science"},{"key":"495_CR13","doi-asserted-by":"publisher","DOI":"10.1145\/2438645.2438649","volume":"9","author":"P Fraigniaud","year":"2013","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9, 17:1-17:24 (2013)","journal-title":"ACM Trans. Algorithms"},{"key":"495_CR14","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proc. 23rd Int. Conference on Distributed Computing Systems (ICDCS), pp. 592-599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"495_CR15","unstructured":"Miller, A., Pelc, A.: Fast deterministic rendezvous in labeled lines. In: Proc. 37th International Symposium on Distributed Computing (DISC), pp. 29:1-29:22 (2023)"},{"key":"495_CR16","doi-asserted-by":"crossref","unstructured":"Pelc, A.: Deterministic rendezvous algorithms, In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities, Springer, LNCS 11340 (2019)","DOI":"10.1007\/978-3-030-11072-7_17"},{"key":"495_CR17","unstructured":"Pattanayak, D., Pelc, A.: Computing functions by teams of deterministic finite automata. CoRR arXiv:abs\/2310.01151 (2023)"},{"key":"495_CR18","doi-asserted-by":"crossref","unstructured":"Stachowiak, G.: Asynchronous Deterministic Rendezvous on the Line Proc. 35th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), pp. 497\u2013508 (2009)","DOI":"10.1007\/978-3-540-95891-8_45"},{"key":"495_CR19","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 599\u2013608 (2007)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-025-00495-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-025-00495-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-025-00495-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T01:39:21Z","timestamp":1782697161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-025-00495-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["495"],"URL":"https:\/\/doi.org\/10.1007\/s00446-025-00495-7","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"30 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None of the authors have any Conflict of interest in the manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"10"}}