{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:03:28Z","timestamp":1776942208279,"version":"3.51.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031917356","type":"print"},{"value":"9783031917363","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91736-3_10","type":"book-chapter","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:02:37Z","timestamp":1747864957000},"page":"159-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Visibility vs. Memory Trade-Off for\u00a0Stand-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-1087-410X","authenticated-orcid":false,"given":"Hirotsugu","family":"Kakugawa","sequence":"additional","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-0001-9400-1095","authenticated-orcid":false,"given":"Fukuhito","family":"Ooshita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1414-8033","authenticated-orcid":false,"given":"Masahiro","family":"Shibata","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":[[2025,5,22]]},"reference":[{"issue":"1","key":"10_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":"10_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":"10_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 2013, pp. 337\u2013346 (2013)","DOI":"10.1109\/ICDCS.2013.27"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bramas, Q., et al.: Stand-up indulgent gathering on lines for myopic luminous robots. In: Proceedings of 38th International Conference on Advanced Information Networking and Applications (AINA-2024), pp. 110\u2013121 (2024)","DOI":"10.1007\/978-3-031-57853-3_10"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bramas, Q., Kamei, S., Lamani, A., Tixeuil, S.: Stand-up indulgent gathering on lines. In: Dolev, S., Schieber, B. (eds.) Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, pp. 451\u2013465 (2023)","DOI":"10.1007\/978-3-031-44274-2_34"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bramas, Q., Kamei, S., Lamani, A., Tixeuil, S.: Stand-up indulgent gathering on rings. In: Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, pp. 119\u2013137 (2024)","DOI":"10.1007\/978-3-031-60603-8_7"},{"key":"10_CR7","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)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR8","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"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","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":"5","key":"10_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., Parv\u00e9dy, P.R.: Self-stabilizing gathering of mobile robots under crash or byzantine faults. Distrib. Comput. 33(5), 393\u2013421 (2020)","journal-title":"Distrib. Comput."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Researchin Moving and Computing. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-030-11072-7"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2012.07.004","volume":"509","author":"S Guilbault","year":"2013","unstructured":"Guilbault, S., Pelc, A.: Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. Theor. Comput. Sci. 509, 86\u201396 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Guilbault, S., Pelc, A.: Gathering asynchronous oblivious agents with restricted vision in an infinite line. In: SSS, pp. 296\u2013310 (2013)","DOI":"10.1007\/978-3-319-03089-0_21"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Kamei, S., Lamani, A., Ooshita, F.: Asynchronous ring gathering by oblivious robots with limited vision. In: 2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops, pp. 46\u201349 (2014)","DOI":"10.1109\/SRDSW.2014.15"},{"key":"10_CR15","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S., Wada, K.: Gathering on rings for myopic asynchronous robots with lights. In: Proceedings of 23rd International Conference on Principles of Distributed Systems (OPODIS 2019), pp. 27:1\u201327:17 (2019)"},{"issue":"1","key":"10_CR16","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. Theor. Comput. Sci. 390(1), 27\u201339 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Ooshita, F., Tixeuil, S.: Ring exploration with myopic luminous robots. In: Stabilization, Safety, and Security of Distributed Systems, pp. 301\u2013316 (2018)","DOI":"10.1007\/978-3-030-03232-6_20"},{"issue":"4","key":"10_CR18","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-91736-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:02:44Z","timestamp":1747864964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91736-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031917356","9783031917363"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91736-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 May 2025","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":"Delphi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.torontomu.ca\/sirocco-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}