{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T10:55:16Z","timestamp":1789988116206,"version":"4.0.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,21]],"date-time":"2014-04-21T00:00:00Z","timestamp":1398038400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00446-014-0216-5","type":"journal-article","created":{"date-parts":[[2014,4,20]],"date-time":"2014-04-20T06:28:07Z","timestamp":1397975287000},"page":"111-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Deterministic polynomial approach in the plane"],"prefix":"10.1007","volume":"28","author":[{"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"}]}],"member":"297","published-online":{"date-parts":[[2014,4,21]]},"reference":[{"key":"216_CR1","doi-asserted-by":"crossref","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":"216_CR2","doi-asserted-by":"crossref","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":"216_CR3","doi-asserted-by":"crossref","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. Logist. 49, 256\u2013274 (2002)","journal-title":"Naval Res. Logist."},{"key":"216_CR4","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Int. Series in Operations research and Management Science. Kluwer, Berlin (2002)"},{"key":"216_CR5","doi-asserted-by":"crossref","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. Prob. 36, 223\u2013231 (1999)","journal-title":"J. Appl. Prob."},{"key":"216_CR6","doi-asserted-by":"crossref","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. Prob. 28, 839\u2013851 (1990)","journal-title":"J. Appl. Prob."},{"key":"216_CR7","doi-asserted-by":"crossref","unstructured":"Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Proceedings of 24th International Symposium on Distributed Computing (DISC 2010), pp. 297\u2013311","DOI":"10.1007\/978-3-642-15763-9_28"},{"key":"216_CR8","doi-asserted-by":"crossref","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Proceedings of 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), pp. 1181\u20131196","DOI":"10.1007\/3-540-45061-0_90"},{"key":"216_CR9","doi-asserted-by":"crossref","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":"216_CR10","doi-asserted-by":"crossref","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":"216_CR11","doi-asserted-by":"crossref","unstructured":"Collins, A., Czyzowicz, J., Gasieniec, L., Labourel, A.: Tell me where I am so I can meet you sooner. In: Procedings of 37th international colloquium on automata, languages and programming (ICALP 2010), pp. 502\u2013514","DOI":"10.1007\/978-3-642-14162-1_42"},{"key":"216_CR12","doi-asserted-by":"crossref","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":"216_CR13","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8, Article 37 (2012)","DOI":"10.1145\/2344422.2344427"},{"key":"216_CR14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G Marco De","year":"2006","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theor. Comput. Sci. 355, 315\u2013326 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"216_CR15","doi-asserted-by":"crossref","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":"216_CR16","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Anonymous meeting in networks. In: Proceedings 24rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 737\u2013747","DOI":"10.1137\/1.9781611973105.53"},{"key":"216_CR17","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Peleg, D.: Gathering despite mischief. In: Proceedings of thre 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 527\u2013540","DOI":"10.1137\/1.9781611973099.45"},{"key":"216_CR18","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proceedings 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2013), pp. 92\u201399","DOI":"10.1145\/2484239.2484245"},{"key":"216_CR19","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous oblivious robots with limited visibility. In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), pp. 247\u2013258","DOI":"10.1007\/3-540-44693-1_22"},{"key":"216_CR20","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9, article 17 (2013)","DOI":"10.1145\/2438645.2438649"},{"key":"216_CR21","doi-asserted-by":"crossref","unstructured":"Guilbault, S., Pelc, A.: Asynchronous rendezvous of anonymous agents in arbitrary graphs. In: Proceedings of 15th International Conference on Principles of Distributed Systems (OPODIS 2011), pp. 162\u2013173","DOI":"10.1007\/978-3-642-25873-2_29"},{"key":"216_CR22","doi-asserted-by":"crossref","first-page":"3235","DOI":"10.1016\/j.tcs.2010.05.020","volume":"411","author":"R Klasing","year":"2010","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci. 411, 3235\u20133246 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"216_CR23","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2007.09.032","volume":"390","author":"R Klasing","year":"2008","unstructured":"Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390, 27\u201339 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"216_CR24","doi-asserted-by":"crossref","unstructured":"Kowalski, D., Malinowski, A.: How to meet in anonymous network. In: Proceedings 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), pp. 44\u201358","DOI":"10.1007\/11780823_5"},{"key":"216_CR25","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized rendez-vous with limited memory, Proc. 8th Latin American Theoretical Informatics (LATIN 2008), Springer LNCS 4957, 605\u2013616","DOI":"10.1007\/978-3-540-78773-0_52"},{"key":"216_CR26","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proceedings of 23rd International Conference on Distributed Computing Systems (ICDCS 2003), IEEE, pp. 592\u2013599","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"216_CR27","doi-asserted-by":"crossref","first-page":"1650","DOI":"10.1137\/S036301299427816X","volume":"34","author":"W Lim","year":"1996","unstructured":"Lim, W., Alpern, S.: Minimax rendezvous on the line. SIAM J. Control Optim. 34, 1650\u20131665 (1996)","journal-title":"SIAM J. Control Optim."},{"key":"216_CR28","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"216_CR29","doi-asserted-by":"crossref","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":"216_CR30","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599\u2013608"},{"key":"216_CR31","doi-asserted-by":"crossref","unstructured":"Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Proceedings of International Colloquium on Automata, Languages, and Programming (ICALP 1996), pp. 610\u2013621","DOI":"10.1007\/3-540-61440-0_163"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0216-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0216-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0216-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T13:16:27Z","timestamp":1746191787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0216-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,21]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["216"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0216-5","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,21]]}}}