{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T18:33:32Z","timestamp":1790188412261,"version":"4.1.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T00:00:00Z","timestamp":1683763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T00:00:00Z","timestamp":1683763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-CE25-0009-03"],"award-info":[{"award-number":["ANR-16-CE25-0009-03"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2018-03899"],"award-info":[{"award-number":["2018-03899"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s00453-023-01122-2","type":"journal-article","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T10:38:30Z","timestamp":1683801510000},"page":"3110-3143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Almost Universal Anonymous Rendezvous in the Plane"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9593-7802","authenticated-orcid":false,"given":"Yoann","family":"Dieudonn\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franck","family":"Petit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,11]]},"reference":[{"key":"1122_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/050645221","volume":"36","author":"N Agmon","year":"2006","unstructured":"Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36, 56\u201382 (2006)","journal-title":"SIAM J. Comput."},{"key":"1122_CR2","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. Control Optim. 33, 673\u2013683 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"1122_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/nav.10011","volume":"49","author":"S Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search on labelled networks. Naval Res. Logistics 49, 256\u2013274 (2002)","journal-title":"Naval Res. Logistics"},{"key":"1122_CR4","series-title":"International Series in Operations Research and Management Science","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. International Series in Operations Research and Management Science, Kluwer Academic Publisher, Alphen aan den Rijn (2002)"},{"key":"1122_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1239\/jap\/1032374243","volume":"36","author":"J Alpern","year":"1999","unstructured":"Alpern, J., Baston, V., Essegaier, S.: Rendezvous search on a graph. J. Appl. Probab. 36, 223\u2013231 (1999)","journal-title":"J. Appl. Probab."},{"key":"1122_CR6","doi-asserted-by":"publisher","first-page":"839","DOI":"10.2307\/3214827","volume":"28","author":"E Anderson","year":"1990","unstructured":"Anderson, E., Weber, R.: The rendezvous problem on discrete locations. J. Appl. Probab. 28, 839\u2013851 (1990)","journal-title":"J. Appl. Probab."},{"key":"1122_CR7","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H Attiya","year":"1988","unstructured":"Attiya, H., Snir, M., Warmuth, M.: Computing on an anonymous ring. J. ACM 35, 845\u2013875 (1988)","journal-title":"J. ACM"},{"key":"1122_CR8","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Symposium on the Theory of Computing (STOC 1980), pp. 82\u201393","DOI":"10.1145\/800141.804655"},{"key":"1122_CR9","doi-asserted-by":"crossref","unstructured":"Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Proc. 24th International Symposium on Distributed Computing (DISC 2010), pp. 297\u2013311","DOI":"10.1007\/978-3-642-15763-9_28"},{"key":"1122_CR10","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF02798690","volume":"8","author":"A Beck","year":"1970","unstructured":"Beck, A., Newman, D.J.: Yet more on the linear search problem. Israel J. Math. 8, 419\u2013429 (1970)","journal-title":"Israel J. Math."},{"key":"1122_CR11","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. 18th ACM Symp. on Principles of Distributed Computing (PODC 1999), pp. 181\u2013188","DOI":"10.1145\/301308.301355"},{"key":"1122_CR12","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":"1122_CR13","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":"1122_CR14","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":"1122_CR15","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Petit, F., Pelc, A.: Proc. 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), pp. 117\u2013127"},{"key":"1122_CR16","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S., Kosowski, A.: Constructing a map of an anonymous graph: applications of universal sequences. In: Proc. 14th International Conference on Principles of Distributed Systems (OPODIS 2010), pp. 119\u2013134","DOI":"10.1007\/978-3-642-17653-1_10"},{"key":"1122_CR17","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":"1122_CR18","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"34","author":"R Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM J. Comput. 34, 1516\u20131528 (2005)","journal-title":"SIAM J. Comput."},{"key":"1122_CR19","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/060665257","volume":"38","author":"R Cohen","year":"2008","unstructured":"Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. SIAM J. Comput. 38, 276\u2013302 (2008)","journal-title":"SIAM J. Comput."},{"key":"1122_CR20","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Gasieniec, L., Killick, R., Kranakis, E.: Symmetry breaking in the plane: rendezvous by robots with unknown attributes. In: Proc. 38th ACM Symp. on Principles of Distributed Computing (PODC 2019), pp. 4\u201313","DOI":"10.1145\/3293611.3331608"},{"key":"1122_CR21","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":"1122_CR22","doi-asserted-by":"publisher","first-page":"37:1","DOI":"10.1145\/2344422.2344427","volume":"8","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8, 37:1-37:14 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"1122_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00446-016-0274-y","volume":"30","author":"G D\u2019Angelo","year":"2017","unstructured":"D\u2019Angelo, G., Navarra, A., Nisse, N.: A unified approach for gathering and exclusive searching on rings under weak assumptions. Distrib. Comput. 30, 17\u201348 (2017)","journal-title":"Distrib. Comput."},{"key":"1122_CR24","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G De Marco","year":"2006","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theoret. Comput. Sci. 355, 315\u2013326 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"1122_CR25","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":"1122_CR26","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1007\/s00453-015-9982-0","volume":"74","author":"Y Dieudonn\u00e9","year":"2016","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Anonymous meeting in networks. Algorithmica 74, 908\u2013946 (2016)","journal-title":"Algorithmica"},{"key":"1122_CR27","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-014-0216-5","volume":"28","author":"Y Dieudonn\u00e9","year":"2015","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Deterministic polynomial approach in the plane. Distrib. Comput. 28, 111\u2013129 (2015)","journal-title":"Distrib. Comput."},{"key":"1122_CR28","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":"1122_CR29","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/2629656","volume":"11","author":"Y Dieudonn\u00e9","year":"2014","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Peleg, D.: Gathering despite mischief. ACM Trans. Algorithms 11, 1:1-1:28 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"1122_CR30","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2011.12.010","volume":"428","author":"Y Dieudonn\u00e9","year":"2012","unstructured":"Dieudonn\u00e9, Y., Petit, F.: Self-stabilizing gathering with strong multiplicity detection. Theoret. Comput. Sci. 428, 47\u201357 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"1122_CR31","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 oblivious robots with limited visibility. Theor. Comput. Sci. 337, 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"1122_CR32","doi-asserted-by":"publisher","first-page":"17:1","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":"1122_CR33","doi-asserted-by":"crossref","unstructured":"Guilbault, S., Pelc, A.: Asynchronous rendezvous of anonymous agents in arbitrary graphs. In: Proc. 15th International Conference on Principles of Distributed Systems (OPODIS 2011), pp. 162\u2013173","DOI":"10.1007\/978-3-642-25873-2_29"},{"key":"1122_CR34","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/S0022-0000(02)00023-5","volume":"65","author":"M Kouck\u00fd","year":"2002","unstructured":"Kouck\u00fd, M.: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65, 717\u2013726 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"1122_CR35","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2008.02.010","volume":"399","author":"D Kowalski","year":"2008","unstructured":"Kowalski, D., Malinowski, A.: How to meet in anonymous network. Theor. Comput. Sci. 399, 141\u2013156 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"1122_CR36","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized Rendez-Vous with limited memory. In: Proc. 8th Latin American Theoretical Informatics (LATIN 2008), Springer LNCS 4957, pp. 605\u2013616","DOI":"10.1007\/978-3-540-78773-0_52"},{"key":"1122_CR37","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 2003), IEEE, pp. 592\u2013599","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"1122_CR38","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1994.1086","volume":"114","author":"E Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., van der Berg, J.: Computing Boolean functions on anonymous networks. Inf. Comput. 114, 214\u2013236 (1994)","journal-title":"Inf. Comput."},{"key":"1122_CR39","volume-title":"Distributed Algorithms","author":"NL Lynch","year":"1996","unstructured":"Lynch, N.L.: Distributed Algorithms. Morgan Kaufmann Publ. Inc., San Francisco (1996)"},{"key":"1122_CR40","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331\u2013347 (2012)","journal-title":"Networks"},{"key":"1122_CR41","doi-asserted-by":"crossref","unstructured":"Pelc, A., Yadav, R.N.: Using time to break symmetry: universal deterministic anonymous rendezvous. In: Proc. 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2019), pp. 85\u201392","DOI":"10.1145\/3323165.3323182"},{"key":"1122_CR42","doi-asserted-by":"crossref","unstructured":"Pelc, A., Yadav, R.N.: Latecomers help to meet: deterministic anonymous gathering in the plane. In: Proc. 21st International Conference on Distributed Computing and Networking (ICDCN 2020), pp. 4:1\u20134:10","DOI":"10.1145\/3369740.3369767"},{"key":"1122_CR43","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28, 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"key":"1122_CR44","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/2601068","volume":"10","author":"A Ta-Shma","year":"2014","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. ACM Trans. Algorithms 10, 12:1-12:15 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"1122_CR45","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: part I-characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1122_CR46","doi-asserted-by":"crossref","unstructured":"Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Proceedings of the Colloquium on Automata, Languages, and Programming (ICALP 1996), Springer LNCS 1099, 610\u2013621","DOI":"10.1007\/3-540-61440-0_163"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01122-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01122-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01122-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T06:24:20Z","timestamp":1729405460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01122-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,11]]},"references-count":46,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1122"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01122-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,11]]},"assertion":[{"value":"27 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}