{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:40:47Z","timestamp":1782970847236,"version":"3.54.5"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,3,27]],"date-time":"2014-03-27T00:00:00Z","timestamp":1395878400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s00446-014-0212-9","type":"journal-article","created":{"date-parts":[[2014,3,26]],"date-time":"2014-03-26T04:50:57Z","timestamp":1395809457000},"page":"255-285","source":"Crossref","is-referenced-by-count":54,"title":["Gathering on rings under the Look\u2013Compute\u2013Move model"],"prefix":"10.1007","volume":"27","author":[{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,3,27]]},"reference":[{"key":"212_CR1","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":"212_CR2","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 the 24th Internatioanal Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science, vol. 6343, pp. 297\u2013311 (2010)","DOI":"10.1007\/978-3-642-15763-9_28"},{"key":"212_CR3","doi-asserted-by":"crossref","unstructured":"Blin, L., Burman, J., Nisse, N.: Exclusive graph searching. In: Proceedings of the 21st Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, vol. 8125, pp. 181\u2013192 (2013)","DOI":"10.1007\/978-3-642-40450-4_16"},{"key":"212_CR4","doi-asserted-by":"crossref","unstructured":"Blin, L., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Exclusive perpetual ring exploration without chirality. In: Procedings of the 24th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science, vol. 6343, pp. 312\u2013327. Springer (2010)","DOI":"10.1007\/978-3-642-15763-9_29"},{"key":"212_CR5","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S.: Rendezvous of mobile agents without agreement on local orientation. In: Proceedings of the 37th International Conference on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 6199, pp. 515\u2013526 (2010)","DOI":"10.1007\/978-3-642-14162-1_43"},{"key":"212_CR6","doi-asserted-by":"crossref","unstructured":"Cord-Landwehr, A., Degener, B., Fischer, M., H\u00fcllmann, M., Kempkes, B., Klaas, A., Kling, P., Kurras, S., M\u00e4rtens, M., Der Heide, F.M.A., Raupach, C., Swierkot, K., Warner, D., Weddemann, C., Wonisch, D.: A new approach for analyzing convergence algorithms for mobile robots. In: Proceedings of the 38th International Conference on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 6756, pp. 650\u2013661 (2011)","DOI":"10.1007\/978-3-642-22012-8_52"},{"key":"212_CR7","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. In: Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 22\u201330 (2010)","DOI":"10.1137\/1.9781611973075.3"},{"key":"212_CR8","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Di Stefano, G., Klasing, R., Navarra, A.: Gathering of robots on anonymous grids without multiplicity detection. In: Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, vol. 7355, pp. 327\u2013338 (2012)","DOI":"10.1007\/978-3-642-31104-8_28"},{"key":"212_CR9","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering of six robots on anonymous symmetric rings. In: Proceedings of the 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, vol. 6796, pp. 174\u2013185 (2011)","DOI":"10.1007\/978-3-642-22212-2_16"},{"key":"212_CR10","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: How to gather asynchronous oblivious robots on anonymous rings. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science, vol. 7611, pp. 330\u2013344 (2012)","DOI":"10.1007\/978-3-642-33651-5_23"},{"key":"212_CR11","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering asynchronous and oblivious robots on basic graph topologies under the look\u2013compute\u2013move model. In: S. Alpern, R. Fokkink, L. Gasieniec, R. Lindelauf, V. Subrahmanian (eds.) Search Theory: A Game Theoretic Perspective, pp. 197\u2013222. Springer, Berlin (2013)","DOI":"10.1007\/978-1-4614-6825-7_13"},{"key":"212_CR12","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A., Nisse, N., Suchan, K.: A unified approach for different tasks on rings in robot-based computing systems. In: Proceedings of the 15th IEEE IPDPS Workshop on Advances in Parallel and Distributed Computational Models (APDCM), pp. 667\u2013676 (2013)","DOI":"10.1109\/IPDPSW.2013.89"},{"key":"212_CR13","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 139\u2013148 (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"212_CR14","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":"212_CR15","doi-asserted-by":"crossref","unstructured":"Di Stefano, G., Navarra, A.: Optimal gathering of oblivious robots in anonymous graphs. In: Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, vol. 8179, pp. 213\u2013224 (2013)","DOI":"10.1007\/978-3-319-03578-9_18"},{"issue":"14\u201315","key":"212_CR16","doi-asserted-by":"crossref","first-page":"1583","DOI":"10.1016\/j.tcs.2010.01.007","volume":"411","author":"P Flocchini","year":"2010","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Remembering without memory: tree exploration by asynchronous oblivious robots. Theor. Comput. Sci. 411(14\u201315), 1583\u20131598 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"212_CR17","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1007\/s00453-011-9611-5","volume":"65","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Computing without communicating: ring exploration by asynchronous oblivious robots. Algorithmica 65(3), 562\u2013583 (2013)","journal-title":"Algorithmica"},{"key":"212_CR18","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337, 147\u2013168 (2005)"},{"key":"212_CR19","doi-asserted-by":"crossref","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Randomized gathering of mobile robots with local-multiplicity detection. In: Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Lecture Notes in Computer Science, vol. 5873, pp. 384\u2013398 (2009)","DOI":"10.1007\/978-3-642-05118-0_27"},{"key":"212_CR20","doi-asserted-by":"crossref","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Mobile robots gathering algorithm with local weak multiplicity in rings. In: Proceedings of the 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, vol. 6058, pp. 101\u2013113 (2010)","DOI":"10.1007\/978-3-642-13284-1_9"},{"key":"212_CR21","doi-asserted-by":"crossref","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Asynchronous mobile robot gathering from symmetric configurations. In: Proceedings of the 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, vol. 6796, pp. 150\u2013161 (2011)","DOI":"10.1007\/978-3-642-22212-2_14"},{"key":"212_CR22","doi-asserted-by":"crossref","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Gathering an even number of robots in an odd ring without global multiplicity detection. In: Proceedings of 37th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS, vol. 7464, pp. 542\u2013553 (2012)","DOI":"10.1007\/978-3-642-32589-2_48"},{"key":"212_CR23","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":"212_CR24","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":"212_CR25","first-page":"325","volume":"18","author":"M Koren","year":"2010","unstructured":"Koren, M.: Gathering small number of mobile asynchronous robots on ring. Zeszyty Naukowe Wydzialu ETI Politechniki Gdanskiej. Technologie Informacyjne 18, 325\u2013331 (2010)","journal-title":"Zeszyty Naukowe Wydzialu ETI Politechniki Gdanskiej. Technologie Informacyjne"},{"issue":"4","key":"212_CR26","doi-asserted-by":"crossref","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(4), 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"key":"212_CR27","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Souissi, S., D\u00e9fago, X.: Gathering two stateless mobile robots using very inaccurate compasses in finite time. In: Proceedings of the 1st International Conference on Robot Communication and Coordination (RoboComm), pp. 48:1\u201348:4 (2007)","DOI":"10.4108\/ICST.ROBOCOMM2007.2199"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0212-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0212-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0212-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T22:50:05Z","timestamp":1565304605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0212-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,27]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["212"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0212-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,27]]}}}