{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T12:27:23Z","timestamp":1776083243817,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031606021","type":"print"},{"value":"9783031606038","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60603-8_7","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:01:39Z","timestamp":1716379299000},"page":"119-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Stand-Up Indulgent Gathering on\u00a0Rings"],"prefix":"10.1007","author":[{"given":"Quentin","family":"Bramas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sayaka","family":"Kamei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anissa","family":"Lamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"issue":"1","key":"7_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(1), 56\u201382 (2006)","journal-title":"SIAM J. Comput."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-31277-0_7","volume-title":"Networked Systems","author":"T Balabonski","year":"2019","unstructured":"Balabonski, T., Courtieu, P., Pelle, R., Rieg, L., Tixeuil, S., Urbain, X.: Continuous vs. discrete asynchronous moves: a certified approach for mobile robots. In: Atig, M.F., Schwarzmann, A.A. (eds.) NETYS 2019. LNCS, vol. 11704, pp. 93\u2013109. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31277-0_7"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In: IEEE 33rd International Conference on Distributed Computing Systems (ICDCS), pp. 337\u2013346 (2013)","DOI":"10.1109\/ICDCS.2013.27"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-031-44274-2_34","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"Q Bramas","year":"2023","unstructured":"Bramas, Q., Kamei, S., Lamani, A., Tixeuil, S.: Stand-up indulgent gathering on lines. In: Dolev, S., Schieber, B. (eds.) SSS 2023. LNCS, vol. 14310, pp. 451\u2013465. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44274-2_34"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bramas, Q., Kamei, S., Lamani, A., Tixeuil, S.: Stand-up indulgent gathering on rings (2024). arXiv:2402.14233","DOI":"10.1007\/978-3-031-44274-2_34"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-64348-5_4","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"Q Bramas","year":"2020","unstructured":"Bramas, Q., Lamani, A., Tixeuil, S.: Stand up indulgent rendezvous. In: Devismes, S., Mittal, N. (eds.) SSS 2020. LNCS, vol. 12514, pp. 45\u201359. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64348-5_4"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-030-89240-1_2","volume-title":"Algorithms for Sensor Systems","author":"Q Bramas","year":"2021","unstructured":"Bramas, Q., Lamani, A., Tixeuil, S.: Stand up indulgent gathering. In: G\u0105sieniec, L., Klasing, R., Radzik, T. (eds.) ALGOSENSORS 2021. LNCS, vol. 12961, pp. 17\u201328. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89240-1_2"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2022.10.015","volume":"939","author":"Q Bramas","year":"2023","unstructured":"Bramas, Q., Lamani, A., Tixeuil, S.: Stand up indulgent gathering. Theor. Comput. Sci. 939, 63\u201377 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2022.10.015","journal-title":"Theor. Comput. Sci."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-25258-2_22","volume-title":"Structural Information and Communication Complexity","author":"Q Bramas","year":"2015","unstructured":"Bramas, Q., Tixeuil, S.: Wait-free gathering without chirality. In: Scheideler, C. (ed.) SIROCCO 2014. LNCS, vol. 9439, pp. 313\u2013327. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25258-2_22"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00446-019-00359-x","volume":"33","author":"X D\u00e9fago","year":"2020","unstructured":"D\u00e9fago, X., Potop-Butucaru, M., Raipin-Parv\u00e9dy, P.: Self-stabilizing gathering of mobile robots under crash or byzantine faults. Distrib. Comput. 33, 393\u2013421 (2020)","journal-title":"Distrib. Comput."},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Research in Moving and Computing. LNCS, vol. 11340. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7","DOI":"10.1007\/978-3-030-11072-7"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","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. Theoret. Comput. Sci. 390(1), 27\u201339 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"7_CR13","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(4), 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60603-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:02:38Z","timestamp":1716379358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60603-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606021","9783031606038"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60603-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietri sul Mare","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sirocco2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}