{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:22Z","timestamp":1759638982665,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_36","type":"book-chapter","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T03:30:06Z","timestamp":1507260606000},"page":"484-488","source":"Crossref","is-referenced-by-count":8,"title":["Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights"],"prefix":"10.1007","author":[{"given":"Takashi","family":"Okumura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koichi","family":"Wada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"Katayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"36_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, 56\u201382 (2006)","journal-title":"SIAM J. Comput."},{"key":"36_CR2","unstructured":"D\u00e9fago, X., Gradinariu Potop-Butucaru, M., Cl\u00e9ment, J., Messika, S., Raipin Parv\u00e9dy, P.: Fault and byzantine tolerant self-stabilizing mobile robots gathering - feasibility study -. CoRRabs\/1602.05546 (2016)"},{"key":"36_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-031-02008-7","volume":"10","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. Synth. Lect. Distrib. Comput. Theor. 10, 1\u2013171 (2012). Morgan & Claypool","journal-title":"Synth. Lect. Distrib. Comput. Theor."},{"key":"36_CR4","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)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Heriban, A., D\u00e9fago, X., Tixeuil, S.: Optimally gathering two robots. Research report, HAL Id: hal-01575451, UPMC Sorbonne Universit\u00e9s, August 2017","DOI":"10.1145\/3154273.3154323"},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/100797916","volume":"41","author":"T Izumi","year":"2012","unstructured":"Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., D\u00e9fago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26\u201346 (2012)","journal-title":"SIAM J. Comput."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Okumura, T., Wada, K., Katayama, Y.: Optimal asynchronous rendezvous for mobile robots with lights. Technical report, arXiv:1707.04449v1 , July 2017","DOI":"10.1007\/978-3-319-69084-1_36"},{"issue":"2\u20133","key":"36_CR8","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.tcs.2007.04.023","volume":"384","author":"G Prencipe","year":"2007","unstructured":"Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoret. Comput. Sci. 384(2\u20133), 222\u2013231 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR9","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, 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Viglietta, G.: Rendezvous of two robots with visible bits. Technical report, arXiv:1211.6039 (2012)","DOI":"10.1007\/978-3-642-45346-5_21"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69084-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T01:28:22Z","timestamp":1659576502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}