{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T02:43:50Z","timestamp":1770345830107,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,5,23]],"date-time":"2016-05-23T00:00:00Z","timestamp":1463961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["PRIN 2010N5K7EB"],"award-info":[{"award-number":["PRIN 2010N5K7EB"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00446-016-0274-y","type":"journal-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T00:44:54Z","timestamp":1464050694000},"page":"17-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["A unified approach for gathering and exclusive searching on rings under weak assumptions"],"prefix":"10.1007","volume":"30","author":[{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,23]]},"reference":[{"issue":"1","key":"274_CR1","doi-asserted-by":"crossref","first-page":"58","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(1), 58\u201382 (2006)","journal-title":"SIAM J. Comput."},{"key":"274_CR2","doi-asserted-by":"crossref","unstructured":"Bampas, E., Czyzowicz, J., G\u0105sieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Proceedings of the 24th International 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":"274_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. Springer (2013)","DOI":"10.1007\/978-3-642-40450-4_16"},{"key":"274_CR4","doi-asserted-by":"crossref","unstructured":"Blin, L., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Exclusive perpetual ring exploration without chirality. In: Proceedings of the 24th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science, vol. 6343, pp. 312\u2013327 (2010)","DOI":"10.1007\/978-3-642-15763-9_29"},{"key":"274_CR5","doi-asserted-by":"crossref","unstructured":"Bonnet, F., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Asynchronous exclusive perpetual grid exploration without sense of direction. In: 15th International Conference on Principles of Distributed Systems (OPODIS), Lecture Notes in Computer Science, vol. 7109, pp. 251\u2013265. Springer (2011)","DOI":"10.1007\/978-3-642-25873-2_18"},{"key":"274_CR6","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S.: Rendezvous of mobile agents without agreement on local orientation. In: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), vol. 6199, pp. 515\u2013526 (2010)","DOI":"10.1007\/978-3-642-14162-1_43"},{"key":"274_CR7","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Flocchini, P., Mans, B., Santoro, N.: Network exploration by silent and oblivious robots. In: 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science, vol. 6410, pp. 208\u2013219. Springer (2010)","DOI":"10.1007\/978-3-642-16926-7_20"},{"issue":"4","key":"274_CR8","doi-asserted-by":"crossref","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(4), 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"issue":"6\u20137","key":"274_CR9","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.tcs.2008.10.005","volume":"410","author":"J Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410(6\u20137), 481\u2013499 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"274_CR10","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.tcs.2014.06.045","volume":"610","author":"G D\u2019Angelo","year":"2016","unstructured":"D\u2019Angelo, G., Di Stefano, G., Klasing, R., Navarra, A.: Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. 610, 158\u2013168 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"274_CR11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-1-4614-6825-7_13","volume-title":"Search Theory: A Game Theoretic Perspective","author":"G D\u2019Angelo","year":"2013","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model. In: Alpern, S., Fokkink, R., G\u0105sieniec, L., Lindelauf, R., Subrahmanian, V. (eds.) Search Theory: A Game Theoretic Perspective, pp. 197\u2013222. Springer, Berlin (2013)"},{"issue":"4","key":"274_CR12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00446-014-0212-9","volume":"27","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering on rings under the look-compute-move model. Distrib. Comput. 27(4), 255\u2013285 (2014)","journal-title":"Distrib. Comput."},{"key":"274_CR13","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.jda.2013.09.006","volume":"26","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering six oblivious robots on anonymous symmetric rings. J. Discrete Algorithms 26, 16\u201327 (2014)","journal-title":"J. Discrete Algorithms"},{"issue":"72","key":"274_CR14","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1007\/s00453-014-9892-6","volume":"4","author":"G D\u2019Angelo","year":"2015","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A., Nisse, N., Suchan, K.: Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica 4(72), 1055\u20131096 (2015)","journal-title":"Algorithmica"},{"key":"274_CR15","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Navarra, A., Nisse, N.: Gathering and exclusive searching on rings under minimal assumptions. In: Proceedings of the 15th International Conference on Distributed Computing and Networking (ICDCN), Lecture Notes in Computer Science, vol. 8314, pp. 149\u2013164. Springer (2014)","DOI":"10.1007\/978-3-642-45249-9_10"},{"key":"274_CR16","doi-asserted-by":"crossref","unstructured":"Di Stafano, G., Navarra, A.: Gathering of oblivious robots on infinite grids with minimum traveled distance. Inf. Comput. (to appear)","DOI":"10.1016\/j.ic.2016.09.004"},{"key":"274_CR17","doi-asserted-by":"crossref","unstructured":"Di Stefano, G., Montanari, P., Navarra, A.: About ungatherability of oblivious and asynchronous robots on anonymous rings. In: Proceedings of the 26th International Workshop on Combinatorial Algorithms (IWOCA\u201915), Lecture Notes in Computer Science, vol. 9538, pp. 136\u2013147. Springer (2016)","DOI":"10.1007\/978-3-319-29516-9_12"},{"key":"274_CR18","doi-asserted-by":"crossref","unstructured":"Dieudonne, Y., Pelc, A., Peleg, D.: Gathering despite mischief. In: Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 527\u2013540 (2012)","DOI":"10.1137\/1.9781611973099.45"},{"issue":"14\u201315","key":"274_CR19","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":"20","key":"274_CR20","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1016\/j.ipl.2011.07.018","volume":"111","author":"P Flocchini","year":"2011","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: How many oblivious robots can explore a line. Inf. Process. Lett. 111(20), 1027\u20131031 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"274_CR21","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":"274_CR22","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, vol. 3. Morgan & Claypool (2012). doi: 10.2200\/S00440ED1V01Y201208DCT010","DOI":"10.2200\/S00440ED1V01Y201208DCT010"},{"key":"274_CR23","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Hard tasks for weak robots: the role of common knowledge in pattern formation by autonomous mobile robots. In: 10th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, vol. 1741, pp. 93\u2013102. Springer (1999)","DOI":"10.1007\/3-540-46632-0_10"},{"key":"274_CR24","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236\u2013245 (2008)","DOI":"10.1016\/j.tcs.2008.02.040"},{"issue":"2","key":"274_CR25","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00446-009-0089-1","volume":"22","author":"D Ilcinkas","year":"2009","unstructured":"Ilcinkas, D., Nisse, N., Soguet, D.: The cost of monotonicity in distributed graph searching. Distrib. Comput. 22(2), 117\u2013127 (2009)","journal-title":"Distrib. Comput."},{"key":"274_CR26","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":"274_CR27","doi-asserted-by":"crossref","unstructured":"Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., D\u00e9fago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26\u201346 (2012)","DOI":"10.1137\/100797916"},{"key":"274_CR28","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":"274_CR29","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 the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, vol. 7464, pp. 542\u2013553 (2012)","DOI":"10.1007\/978-3-642-32589-2_48"},{"key":"274_CR30","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":"274_CR31","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":"274_CR32","doi-asserted-by":"publisher","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring. Synthesis Lectures on Distributed Computing Theory, vol. 1. Morgan & Claypool (2010). doi: 10.2200\/S00278ED1V01Y201004DCT001","DOI":"10.2200\/S00278ED1V01Y201004DCT001"},{"key":"274_CR33","doi-asserted-by":"crossref","unstructured":"Prencipe, G.: Instantaneous actions vs. full asynchronicity: controlling and coordinating a set of autonomous mobile robots. In: Proceedings of the 7th Italian Conference on Theoretical Computer Science (ICTCS), pp. 154\u2013171 (2001)","DOI":"10.1007\/3-540-45446-2_10"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0274-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-016-0274-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0274-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0274-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T14:28:52Z","timestamp":1567952932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-016-0274-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,23]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["274"],"URL":"https:\/\/doi.org\/10.1007\/s00446-016-0274-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,23]]}}}