{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:03:26Z","timestamp":1776942206949,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642258725","type":"print"},{"value":"9783642258732","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25873-2_18","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T10:16:34Z","timestamp":1323339394000},"page":"251-265","source":"Crossref","is-referenced-by-count":30,"title":["Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessia","family":"Milani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-540-92221-6_27","volume-title":"Principles of Distributed Systems","author":"R. Baldoni","year":"2008","unstructured":"Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 428\u2013445. Springer, Heidelberg (2008)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-15763-9_29","volume-title":"Distributed Computing","author":"L. Blin","year":"2010","unstructured":"Blin, L., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Exclusive Perpetual Ring Exploration Without Chirality. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 312\u2013327. Springer, Heidelberg (2010)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bonnet, F., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Asynchronous exclusive perpetual grid exploration without sense of direction. Tech. rep. (2011), \n                  \n                    http:\/\/hal.archives-ouvertes.fr\/hal-00626155\/fr\/","DOI":"10.1007\/978-3-642-25873-2_18"},{"key":"18_CR4","unstructured":"Devismes, S.: Optimal exploration of small rings. In: Proceedings of the Third International Workshop on Reliability, Availability, and Security, WRAS 2010, pp. 9:1\u20139:6. ACM, New York (2010), \n                  \n                    http:\/\/doi.acm.org\/10.1145\/1953563.1953571"},{"key":"18_CR5","unstructured":"Devismes, S., Lamani, A., Petit, F., Raymond, P., Tixeuil, S.: Optimal grid exploration by asynchronous oblivious robots. Tech. rep., CoRR (2011), \n                  \n                    http:\/\/arxiv.org\/abs\/1105.2461"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-11476-2_16","volume-title":"Structural Information and Communication Complexity","author":"S. Devismes","year":"2010","unstructured":"Devismes, S., Petit, F., Tixeuil, S.: Optimal Probabilistic Ring Exploration by Semi-Synchronous Oblivious Robots. In: Kutten, S., \u017derovnik, J. (eds.) SIROCCO 2009. LNCS, vol.\u00a05869, pp. 195\u2013208. Springer, Heidelberg (2010), \n                  \n                    http:\/\/hal.inria.fr\/inria-00360305\/fr\/"},{"key":"18_CR7","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":"18_CR8","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)"},{"issue":"1-3","key":"18_CR9","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, G., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci.\u00a0407(1-3), 412\u2013447 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR10","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.\u00a06796, pp. 150\u2013161. Springer, Heidelberg (2011), \n                  \n                    http:\/\/arxiv.org\/abs\/1104.5660"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-92221-6_28","volume-title":"Principles of Distributed Systems","author":"R. Klasing","year":"2008","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 446\u2013462. Springer, Heidelberg (2008)"},{"issue":"1","key":"18_CR12","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.\u00a0390(1), 27\u201339 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-13284-1_15","volume-title":"Structural Information and Communication Complexity","author":"A. Lamani","year":"2010","unstructured":"Lamani, A., Potop-Butucaru, M.G., Tixeuil, S.: Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol.\u00a06058, pp. 183\u2013196. Springer, Heidelberg (2010)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-45446-2_10","volume-title":"Theoretical Computer Science","author":"G. Prencipe","year":"2001","unstructured":"Prencipe, G.: Instantaneous\n                Actions vs. Full\n                Asynchronicity: Controlling and Coordinating a Set of Autonomous Mobile Robots. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol.\u00a02202, pp. 154\u2013171. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25873-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:28:25Z","timestamp":1558297705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}