{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:47:13Z","timestamp":1764557233854},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_20","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T02:48:26Z","timestamp":1289357306000},"page":"208-219","source":"Crossref","is-referenced-by-count":26,"title":["Network Exploration by Silent and Oblivious Robots"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"first","affiliation":[]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-92221-6_10","volume-title":"Principles of Distributed Systems","author":"Y. Asahiro","year":"2008","unstructured":"Asahiro, Y., Fujita, S., Suzuki, I., Yamashita, M.: A self-stabilizing marching algorithm for a group of oblivious robots. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 125\u2013144. Springer, Heidelberg (2008)"},{"key":"20_CR2","unstructured":"Chalopin, J., Flocchini, P., Mans, B., Santoro, N.: Gathering and rendezvous by oblivious robots in arbitrary graphs, rings, and trees, Technical Report, University of Ottawa (2009)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/3-540-45061-0_90","volume-title":"Automata, Languages and Programming","author":"M. Cieliebak","year":"2003","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1181\u20131196. Springer, Heidelberg (2003)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"34","author":"R. Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM J. Computing\u00a034, 1516\u20131528 (2005)","journal-title":"SIAM J. Computing"},{"issue":"1-3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2008.01.050","volume":"396","author":"X. D\u00e9fago","year":"2008","unstructured":"D\u00e9fago, X., Souissi, S.: Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theoretical Computer Science\u00a0396(1-3), 97\u2013112 (2008)","journal-title":"Theoretical Computer Science"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","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. 203\u2013217. Springer, Heidelberg (2010)"},{"key":"20_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":"20_CR8","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Remembering without memory: Tree exploration by asynchronous oblivious robots. Theoretical Computer Science (2010) (to appear)","DOI":"10.1016\/j.tcs.2010.01.007"},{"issue":"1-3","key":"20_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. Theoretical Computer Science\u00a0407(1-3), 412\u2013447 (2008)","journal-title":"Theoretical Computer Science"},{"key":"20_CR10","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":"20_CR11","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(1), 27\u201339 (2008)","journal-title":"Theoretical Computer Science"},{"key":"20_CR12","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.\u00a028, 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theoretical Computer Science (2010) (to appear)","DOI":"10.1016\/j.tcs.2010.01.037"}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:38:37Z","timestamp":1553215117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}