{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:51Z","timestamp":1759638711978},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642132834"},{"type":"electronic","value":"9783642132841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13284-1_15","type":"book-chapter","created":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T07:43:53Z","timestamp":1275723833000},"page":"183-196","source":"Crossref","is-referenced-by-count":31,"title":["Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots"],"prefix":"10.1007","author":[{"given":"Anissa","family":"Lamani","sequence":"first","affiliation":[]},{"given":"Maria Gradinariu","family":"Potop-Butucaru","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2007.05.011","volume":"385","author":"S. Das","year":"2007","unstructured":"Das, S., Flocchini, P., Kutten, S., Nayak, A., Santoro, N.: Map construction of unknown graphs by multiple agents. Theoretical Computer Science\u00a0385, 34\u201348 (2007)","journal-title":"Theoretical Computer Science"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G. Marco De","year":"2006","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theoretical Computer Science\u00a0355, 315\u2013326 (2006)","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Devismes, S., Petit, F., Tixeuil, S.: Optimal probabilistic ring exploration by asynchronous oblivious robots. In: Proceedings of SIROCCO 2009 (2009)","DOI":"10.1007\/978-3-642-11476-2_16"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Labbani-Igbida, O., Petit, F.: Circle formation of weak mobile robots. TAAS\u00a03(16) (2008)","DOI":"10.1145\/1452001.1452006"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-77096-1_8","volume-title":"Principles of Distributed Systems","author":"P. Flocchini","year":"2007","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Computing without communicating: Ring exploration by asynchronous oblivious robots. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol.\u00a04878, pp. 105\u2013118. Springer, Heidelberg (2007)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-69355-0_5","volume-title":"Structural Information and Communication Complexity","author":"P. Flocchini","year":"2008","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Remembering without memory: Tree exploration by asynchronous oblivious robots. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol.\u00a05058, pp. 33\u201347. Springer, Heidelberg (2008)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/978-3-540-24698-5_62","volume-title":"LATIN 2004: Theoretical Informatics","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple mobile agent rendezvous in a ring. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 599\u2013608. Springer, Heidelberg (2004)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.tcs.2008.07.026","volume":"407","author":"P. Flocchini","year":"2008","unstructured":"Flocchini, P., Prencipe, P., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theoretical Computer Science\u00a0407, 412\u2013447 (2008)","journal-title":"Theoretical Computer Science"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: Gathering of asynchronous oblivious robots on a ring. In: OPODIS, pp. 446\u2013462 (2008)","DOI":"10.1007\/978-3-540-92221-6_28"},{"key":"15_CR10","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. Theoretical Computer Science\u00a0390, 27\u201339 (2008)","journal-title":"Theoretical Computer Science"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1007\/978-3-540-30551-4_56","volume-title":"Algorithms and Computation","author":"D. Kowalski","year":"2004","unstructured":"Kowalski, D., Pelc, A.: Polynomial deterministic rendezvous in arbitrary graphs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 644\u2013656. Springer, Heidelberg (2004)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Lamani, A., Potop-Butucaru, M., Tixeuil, S.: Optimal deterministic ring exploration with oblivious asynchronous robots. CoRR\u00a0abs\/0910.0832 (2009)","DOI":"10.1007\/978-3-642-13284-1_15"},{"key":"15_CR13","unstructured":"Prencipe, G.: CORDA: Distributed coordination of a set of autonomous mobile robots. In: Proc. 4th European Research Seminar on Advances in Distributed Systems (ERSADS 2001), Bertinoro, Italy, May 2001, pp. 185\u2013190 (2001)"},{"issue":"4","key":"15_CR14","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 Journal on Computing\u00a028(4), 1347\u20131363 (1999)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13284-1_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:03:56Z","timestamp":1606187036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13284-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642132834","9783642132841"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13284-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}