{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T07:02:06Z","timestamp":1771916526207,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031442735","type":"print"},{"value":"9783031442742","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-44274-2_34","type":"book-chapter","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T01:02:06Z","timestamp":1696035726000},"page":"451-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Stand-Up Indulgent Gathering on\u00a0Lines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0612-5616","authenticated-orcid":false,"given":"Quentin","family":"Bramas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1716-3028","authenticated-orcid":false,"given":"Sayaka","family":"Kamei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7774-8402","authenticated-orcid":false,"given":"Anissa","family":"Lamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0948-7172","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"issue":"1","key":"34_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":"34_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":"34_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":"34_CR4","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":"34_CR5","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":"34_CR6","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":"34_CR7","doi-asserted-by":"crossref","unstructured":"Castaneda, A., Rajsbaum, S., Alc\u00e1ntara, M., Flores-Penaloza, D.: Fault-tolerant robot gathering problems on graphs with arbitrary appearing times. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 493\u2013502 (2017)","DOI":"10.1109\/IPDPS.2017.70"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Castenow, J., Fischer, M., Harbig, J., Jung, D., auf der Heide, F.M.: Gathering anonymous, oblivious robots on a grid. Theor. Comput. Sci. 815, 289\u2013309 (2020)","DOI":"10.1016\/j.tcs.2020.02.018"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2020.10.011","volume":"849","author":"S Cicerone","year":"2021","unstructured":"Cicerone, S., DiStefano, G., Navarra, A.: Gathering robots in graphs: the central role of synchronicity. Theoret. Comput. Sci. 849, 99\u2013120 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00446-016-0274-y","volume":"30","author":"G D\u2019Angelo","year":"2017","unstructured":"D\u2019Angelo, G., Navarra, A., Nisse, N.: A unified approach for gathering and exclusive searching on rings under weak assumptions. Distrib. Comput. 30(1), 17\u201348 (2017)","journal-title":"Distrib. Comput."},{"issue":"4","key":"34_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00446-014-0212-9","volume":"27","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., Stefano, G.D.: AlfredoNavarra: gathering on rings under the look-compute-move model. Distrib. Comput. 27(4), 255\u2013285 (2014)","journal-title":"Distrib. Comput."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.tcs.2014.06.045","volume":"610","author":"G D\u2019Angelo","year":"2016","unstructured":"D\u2019Angelo, G., Stefano, G.D., Klasing, R., Navarra, A.: Gathering of robots on anonymous grids and trees without multiplicity detection. Theoret. Comput. Sci. 610, 158\u2013168 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR13","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":"34_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11072-7","volume-title":"Distributed Computing by Mobile Entities, Current Researchin Moving and Computing","year":"2019","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Researchin Moving and Computing, vol. 11340. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings. IEICE Trans. 96-A(6), 1072\u20131080 (2013)","DOI":"10.1587\/transfun.E96.A.1072"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-22212-2_14"},{"key":"34_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_48"},{"key":"34_CR18","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S., Wada, K.: Asynchronous gathering in a torus. In: 25th International Conference on Principles of Distributed Systems (OPODIS 2021), vol. 217, pp. 9:1\u20139:17 (2021)"},{"issue":"34\u201336","key":"34_CR19","doi-asserted-by":"publisher","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. Theoret. Comput. Sci. 411(34\u201336), 3235\u20133246 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"34_CR20","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."},{"key":"34_CR21","doi-asserted-by":"publisher","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. Theoret. Comput. Sci. 568, 84\u201396 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"34_CR22","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","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44274-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T01:05:32Z","timestamp":1709859932000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44274-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442735","9783031442742"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44274-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jersey City, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~SSS2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}