{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:17:34Z","timestamp":1763414254743,"version":"3.45.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-11127-2_33","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:50Z","timestamp":1763409830000},"page":"442-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Gathering of\u00a0Asynchronous Robots on\u00a0Circle with\u00a0Limited Visibility Using Finite Communication"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8940-392X","authenticated-orcid":false,"given":"Avisek","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1747-4037","authenticated-orcid":false,"given":"Satakshi","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7008-6135","authenticated-orcid":false,"given":"Buddhadeb","family":"Sau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"issue":"5","key":"33_CR1","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/70.795787","volume":"15","author":"H Ando","year":"1999","unstructured":"Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robot. Autom. 15(5), 818\u2013828 (1999). https:\/\/doi.org\/10.1109\/70.795787","journal-title":"IEEE Trans. Robot. Autom."},{"key":"33_CR2","doi-asserted-by":"publisher","unstructured":"Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: Autonomous mobile robots with lights. Theoret. Comput. Sci. 609, 171\u2013184 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.09.018","DOI":"10.1016\/j.tcs.2015.09.018"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., Meyer auf\u00a0der Heide, F., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of the Twenty-third Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 139\u2013148 (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"33_CR4","doi-asserted-by":"publisher","unstructured":"Di Luna, G.A., Uehara, R., Viglietta, G., Yamauchi, Y.: Gathering on a circle with limited visibility by anonymous oblivious robots. Theoret. Comput. Sci. 1025, 114974 (2025). https:\/\/doi.org\/10.1016\/j.tcs.2024.114974","DOI":"10.1016\/j.tcs.2024.114974"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2016.01.025","volume":"621","author":"P Flocchini","year":"2016","unstructured":"Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous with constant memory. Theoret. Comput. Sci. 621, 57\u201372 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.01.025","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR6","doi-asserted-by":"publisher","unstructured":"Flocchini, P.: Gathering, pp. 63\u201382. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_4","DOI":"10.1007\/978-3-030-11072-7_4"},{"key":"33_CR7","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous oblivious robots with limited visibility. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 247\u2013258. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44693-1_22","DOI":"10.1007\/3-540-44693-1_22"},{"key":"33_CR8","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theoret. Comput. Sc. 337(1), 147\u2013168 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.01.001","DOI":"10.1016\/j.tcs.2005.01.001"},{"key":"33_CR9","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Santoro, N., Sudo, Y., Wada, K.: On Asynchrony, Memory, and Communication: separations and landscapes. In: Bessani, A., D\u00e9fago, X., Nakamura, J., Wada, K., Yamauchi, Y. (eds.) 27th International Conference on Principles of Distributed Systems (OPODIS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0286, pp. 28:1\u201328:23. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2023.28","DOI":"10.4230\/LIPIcs.OPODIS.2023.28"},{"key":"33_CR10","doi-asserted-by":"publisher","unstructured":"Ghosh, S., Sharma, A., Goswami, P., Sau, B.: Brief announcement: Asynchronous gathering of finite memory robots on a circle under limited visibility. In: Dolev, S., Schieber, B. (eds.) Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Jersey City, NJ, USA, October 2-4, 2023, Proceedings. LNCS, vol. 14310, pp. 430\u2013434. Springer (2023).https:\/\/doi.org\/10.1007\/978-3-031-44274-2_32","DOI":"10.1007\/978-3-031-44274-2_32"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-22212-2_12","volume-title":"Structural Information and Communication Complexity","author":"B Katreniak","year":"2011","unstructured":"Katreniak, B.: Convergence with limited visibility by asynchronous mobile robots. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 125\u2013137. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22212-2_12"},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-024-00463-7","volume":"37","author":"D Kirkpatrick","year":"2024","unstructured":"Kirkpatrick, D., Kostitsyna, I., Navarra, A., Prencipe, G., Santoro, N.: On the power of bounded asynchrony: convergence by autonomous robots with limited visibility. Distrib. Comput. 37(3), 279\u2013308 (2024)","journal-title":"Distrib. Comput."},{"key":"33_CR13","doi-asserted-by":"publisher","unstructured":"Mondal, B., Goswami, P., Sharma, A., Sau, B.: Arbitrary pattern formation on a continuous circle by oblivious robot swarm. Theoret. Comput. Sci. 1021, 114882 (2024). https:\/\/doi.org\/10.1016\/j.tcs.2024.114882","DOI":"10.1016\/j.tcs.2024.114882"},{"key":"33_CR14","doi-asserted-by":"publisher","unstructured":"Okumura, T., Wada, K., D\u00e9fago, X.: Optimal l-algorithms for rendezvous of asynchronous mobile robots with external-lights. Theoret. Comput. Sc. 979, 114198 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2023.114198","DOI":"10.1016\/j.tcs.2023.114198"},{"key":"33_CR15","doi-asserted-by":"publisher","unstructured":"Poudel, P., Sharma, G.: Time-optimal gathering under limited visibility with one-axis agreement. Information 12(11) (2021). https:\/\/doi.org\/10.3390\/info12110448","DOI":"10.3390\/info12110448"},{"key":"33_CR16","unstructured":"Sharma, A., Ghosh, S., Sau, B.: Gathering of asynchronous robots on circle with limited visibility using finite communication (2025). https:\/\/arxiv.org\/abs\/2509.04004"},{"issue":"1","key":"33_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462187.1462196","volume":"4","author":"S Souissi","year":"2009","unstructured":"Souissi, S., D\u00e9fago, X., Yamashita, M.: Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Trans. Auton. Adaptive Syst. (TAAS) 4(1), 1\u201327 (2009)","journal-title":"ACM Trans. Auton. Adaptive Syst. (TAAS)"},{"key":"33_CR18","doi-asserted-by":"publisher","unstructured":"Terai, S., Wada, K., Katayama, Y.: Gathering problems for autonomous mobile robots with lights. Theoret. Comput. Sci. 941, 241\u2013261 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2022.11.018","DOI":"10.1016\/j.tcs.2022.11.018"}],"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-032-11127-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:51Z","timestamp":1763409831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","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":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","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":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}