{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T14:50:58Z","timestamp":1770821458825,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T00:00:00Z","timestamp":1519430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00607-018-0595-8","type":"journal-article","created":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T04:11:22Z","timestamp":1519445482000},"page":"1241-1264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Optimal torus exploration by oblivious robots"],"prefix":"10.1007","volume":"101","author":[{"given":"St\u00e9phane","family":"Devismes","sequence":"first","affiliation":[]},{"given":"Anissa","family":"Lamani","sequence":"additional","affiliation":[]},{"given":"Franck","family":"Petit","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,24]]},"reference":[{"issue":"2","key":"595_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ipl.2008.08.011","volume":"109","author":"R Baldoni","year":"2008","unstructured":"Baldoni R, Bonnet F, Milani A, Raynal M (2008) Anonymous graph exploration without collision by mobile robots. Inf Process Lett 109(2):98\u2013103","journal-title":"Inf Process Lett"},{"key":"595_CR2","doi-asserted-by":"crossref","unstructured":"Bonnet F, D\u00e9fago X, Petit F, Potop-Butucaru M, Tixeuil S (2014) Discovering and assessing fine-grained metrics in robot networks protocols. In: 33rd IEEE SRDS workshops, workshop on self-organization in swarm of robots, pp 50\u201359","DOI":"10.1109\/SRDSW.2014.34"},{"key":"595_CR3","doi-asserted-by":"crossref","unstructured":"Chalopin J, Flocchini P, Mans B, Santoro N (2010) Network exploration by silent and oblivious robots. In: WG, pp 208\u2013219","DOI":"10.1007\/978-3-642-16926-7_20"},{"key":"595_CR4","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo G, Di\u00a0Stefano G, Navarra A, Nisse N, Suchan K (2013) A unified approach for different tasks on rings in robot-based computing systems. In: IPDPS workshops, pp 667\u2013676","DOI":"10.1109\/IPDPSW.2013.89"},{"key":"595_CR5","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo G, Navarra A, Nisse N (2014) Gathering and exclusive searching on rings under minimal assumptions. In: ICDCN, pp 149\u2013164","DOI":"10.1007\/978-3-642-45249-9_10"},{"key":"595_CR6","doi-asserted-by":"crossref","unstructured":"Devismes S, Lamani A, Petit F, Raymond P, Tixeuil S (2012) Optimal grid exploration by asynchronous oblivious robots. In: SSS, pp 64\u201376","DOI":"10.1007\/978-3-642-33536-5_7"},{"key":"595_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2013.05.031","volume":"498","author":"S Devismes","year":"2013","unstructured":"Devismes S, Petit F, Tixeuil S (2013) Optimal probabilistic ring exploration by semi-synchronous oblivious robots. Theor Comput Sci 498:10\u201327","journal-title":"Theor Comput Sci"},{"issue":"14\u201315","key":"595_CR8","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1016\/j.tcs.2010.01.007","volume":"411","author":"P Flocchini","year":"2010","unstructured":"Flocchini P, Ilcinkas D, Pelc A, Santoro N (2010) Remembering without memory: tree exploration by asynchronous oblivious robots. Theor Comput Sci 411(14\u201315):1583\u20131598","journal-title":"Theor Comput Sci"},{"issue":"3","key":"595_CR9","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/s00453-011-9611-5","volume":"65","author":"P Flocchini","year":"2013","unstructured":"Flocchini P, Ilcinkas D, Pelc A, Santoro N (2013) Computing without communicating: ring exploration by asynchronous oblivious robots. Algorithmica 65(3):562\u2013583","journal-title":"Algorithmica"},{"key":"595_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02008-7","volume-title":"Distributed computing by oblivious mobile robots. Synthesis lectures on distributed computing theory","author":"P Flocchini","year":"2012","unstructured":"Flocchini P, Prencipe G, Santoro N (2012) Distributed computing by oblivious mobile robots. Synthesis lectures on distributed computing theory. Morgan & Claypool Publishers, San Rafael"},{"issue":"34\u201336","key":"595_CR11","doi-asserted-by":"publisher","first-page":"3235","DOI":"10.1016\/j.tcs.2010.05.020","volume":"411","author":"R Klasing","year":"2010","unstructured":"Klasing R, Kosowski A, Navarra A (2010) Taking advantage of symmetries: gathering of many asynchronous oblivious robots on a ring. Theor Comput Sci 411(34\u201336):3235\u20133246","journal-title":"Theor Comput Sci"},{"key":"595_CR12","doi-asserted-by":"crossref","unstructured":"Lamani A, Potop-Butucaru M, Tixeuil S (2010) Optimal deterministic ring exploration with oblivious asynchronous robots. In: SIROCCO, pp 183\u2013196","DOI":"10.1007\/978-3-642-13284-1_15"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-0595-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0595-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0595-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T21:09:18Z","timestamp":1660511358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-0595-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,24]]},"references-count":12,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["595"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-0595-8","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,24]]},"assertion":[{"value":"30 April 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}