{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:36:27Z","timestamp":1763415387757},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319405087"},{"type":"electronic","value":"9783319405094"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40509-4_22","type":"book-chapter","created":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T02:00:05Z","timestamp":1466128805000},"page":"311-324","source":"Crossref","is-referenced-by-count":10,"title":["Asynchronous Gathering in Rings with 4 Robots"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,18]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-642-33651-5_23","volume-title":"Distributed Computing","author":"G D\u2019Angelo","year":"2012","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: How to gather asynchronous oblivious robots on anonymous rings. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 326\u2013340. Springer, Heidelberg (2012)"},{"issue":"4","key":"22_CR2","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":"22_CR3","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":"4","key":"22_CR4","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1007\/s00453-014-9892-6","volume":"72","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 72(4), 1055\u20131096 (2015)","journal-title":"Algorithmica"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-642-45249-9_10","volume-title":"Distributed Computing and Networking","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., Navarra, A., Nisse, N.: Gathering and exclusive searching on rings under minimal assumptions. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 149\u2013164. Springer, Heidelberg (2014)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-319-29516-9_12","volume-title":"Combinatorial Algorithms","author":"G Stefano Di","year":"2016","unstructured":"Di Stefano, G., Montanari, P., Navarra, A.: About ungatherability of oblivious and asynchronous robots on anonymous rings. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 136\u2013147. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-29516-9_12"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-319-03578-9_18","volume-title":"Structural Information and Communication Complexity","author":"G Stefano Di","year":"2013","unstructured":"Di Stefano, G., Navarra, A.: Optimal gathering of oblivious robots in anonymous graphs. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 213\u2013224. Springer, Heidelberg (2013)"},{"key":"22_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02008-7","volume-title":"Distributed Computing by Oblivious Mobile Robots","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Morgan & Claypool Publishers, San Rafael (2012)"},{"issue":"6","key":"22_CR9","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1587\/transfun.E96.A.1072","volume":"E96\u2013A","author":"T Izumi","year":"2013","unstructured":"Izumi, T., Kamei, S., Ooshita, F.: Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E96\u2013A(6), 1072\u20131080 (2013)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-642-22212-2_14","volume-title":"Structural Information and Communication Complexity","author":"S Kamei","year":"2011","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 150\u2013161. Springer, Heidelberg (2011)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1007\/978-3-642-32589-2_48","volume-title":"Mathematical Foundations of Computer Science 2012","author":"S Kamei","year":"2012","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Gathering an even number of robots in an odd ring without global multiplicity detection. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 542\u2013553. Springer, Heidelberg (2012)"},{"issue":"34\u201336","key":"22_CR12","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(34\u201336), 3235\u20133246 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"22_CR13","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(1), 27\u201339 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"22_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00446-003-0093-9","volume":"17","author":"A Most\u00e9faoui","year":"2004","unstructured":"Most\u00e9faoui, A., Rajsbaum, S., Raynal, M., Roy, M.: Condition-based consensus solvability: a hierarchy of conditions and efficient protocols. Distrib. Comput. 17(1), 1\u201320 (2004)","journal-title":"Distrib. Comput."},{"key":"22_CR15","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.tcs.2014.12.008","volume":"568","author":"F Ooshita","year":"2015","unstructured":"Ooshita, F., Tixeuil, S.: On the self-stabilization of mobile oblivious robots in uniform rings. Theor. Comput. Sci. 568, 84\u201396 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"22_CR16","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."}],"container-title":["Lecture Notes in Computer Science","Ad-hoc, Mobile, and Wireless Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40509-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T21:12:48Z","timestamp":1656709968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40509-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405087","9783319405094"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40509-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}