{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T11:39:35Z","timestamp":1775302775448,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642311031","type":"print"},{"value":"9783642311048","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31104-8_28","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:59:54Z","timestamp":1340629194000},"page":"327-338","source":"Crossref","is-referenced-by-count":17,"title":["Gathering of Robots on Anonymous Grids without Multiplicity Detection"],"prefix":"10.1007","author":[{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"first","affiliation":[]},{"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proc. of the 23rd ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 139\u2013148 (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P. Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci.\u00a0337, 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR3","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, 27\u201339 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-15763-9_28","volume-title":"Distributed Computing","author":"E. Bampas","year":"2010","unstructured":"Bampas, E., Czyzowicz, J., G\u0105sieniec, L., Ilcinkas, D., Labourel, A.: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 297\u2013311. Springer, Heidelberg (2010)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A. Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica\u00a046, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-642-05118-0_27","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"T. Izumi","year":"2009","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Randomized Gathering of Mobile Robots with Local-Multiplicity Detection. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol.\u00a05873, pp. 384\u2013398. Springer, Heidelberg (2009)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-642-22012-8_52","volume-title":"Automata, Languages and Programming","author":"A. Cord-Landwehr","year":"2011","unstructured":"Cord-Landwehr, A., Degener, B., Fischer, M., H\u00fcllmann, M., Kempkes, B., Klaas, A., Kling, P., Kurras, S., M\u00e4rtens, M., Meyer auf der Heide, F., Raupach, C., Swierkot, K., Warner, D., Weddemann, C., Wonisch, D.: A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 650\u2013661. Springer, Heidelberg (2011)"},{"key":"28_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. Theor. Comput. Sci.\u00a0384, 222\u2013231 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S. Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. Control Optim.\u00a033, 673\u2013683 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-14162-1_43","volume-title":"Automata, Languages and Programming","author":"J. Chalopin","year":"2010","unstructured":"Chalopin, J., Das, S.: Rendezvous of Mobile Agents without Agreement on Local Orientation. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol.\u00a06199, pp. 515\u2013526. Springer, Heidelberg (2010)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. In: Proc. of the 21st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 22\u201330 (2010)","DOI":"10.1137\/1.9781611973075.3"},{"key":"28_CR12","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":"28_CR13","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)"},{"key":"28_CR14","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Computing without communicating: Ring exploration by asynchronous oblivious robots. Algorithmica (to appear)"},{"issue":"14-15","key":"28_CR15","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.: Remembering without memory: Tree exploration by asynchronous oblivious robots. Theor. Comput. Sci.\u00a0411(14-15), 1583\u20131598 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR16","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.: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci.\u00a0411, 3235\u20133246 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-22212-2_16","volume-title":"Structural Information and Communication Complexity","author":"G. D\u2019Angelo","year":"2011","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering of Six Robots on Anonymous Symmetric Rings. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 174\u2013185. Springer, Heidelberg (2011)"},{"key":"28_CR18","first-page":"325","volume":"18","author":"M. Koren","year":"2010","unstructured":"Koren, M.: Gathering small number of mobile asynchronous robots on ring. Zeszyty Naukowe Wydzialu ETI Politechniki Gdanskiej. Technologie Informacyjne\u00a018, 325\u2013331 (2010)","journal-title":"Zeszyty Naukowe Wydzialu ETI Politechniki Gdanskiej. Technologie Informacyjne"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-13284-1_9","volume-title":"Structural Information and Communication Complexity","author":"T. Izumi","year":"2010","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol.\u00a06058, pp. 101\u2013113. Springer, Heidelberg (2010)"},{"key":"28_CR20","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)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31104-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:37:07Z","timestamp":1558312627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31104-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311031","9783642311048"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31104-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}