{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T16:53:07Z","timestamp":1780073587306,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642452482","type":"print"},{"value":"9783642452499","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-45249-9_10","type":"book-chapter","created":{"date-parts":[[2014,1,2]],"date-time":"2014-01-02T06:08:11Z","timestamp":1388642891000},"page":"149-164","source":"Crossref","is-referenced-by-count":13,"title":["Gathering and Exclusive Searching on Rings under Minimal Assumptions"],"prefix":"10.1007","author":[{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","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":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-33651-5_29","volume-title":"Distributed Computing","author":"L. Blin","year":"2012","unstructured":"Blin, L., Burman, J., Nisse, N.: Brief announcement: Distributed exclusive and perpetual tree searching. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 403\u2013404. Springer, Heidelberg (2012)"},{"key":"10_CR3","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":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-25873-2_18","volume-title":"Principles of Distributed Systems","author":"F. Bonnet","year":"2011","unstructured":"Bonnet, F., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Asynchronous exclusive perpetual grid exploration without sense of direction. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 251\u2013265. Springer, Heidelberg (2011)"},{"key":"10_CR5","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. LNCS, vol.\u00a06199, pp. 515\u2013526. Springer, Heidelberg (2010)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-16926-7_20","volume-title":"Graph Theoretic Concepts in Computer Science","author":"J. Chalopin","year":"2010","unstructured":"Chalopin, J., Flocchini, P., Mans, B., Santoro, N.: Network exploration by silent and oblivious robots. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 208\u2013219. Springer, Heidelberg (2010)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-31104-8_28","volume-title":"Structural Information and Communication Complexity","author":"G. D\u2019Angelo","year":"2012","unstructured":"D\u2019Angelo, G., Di Stefano, G., Klasing, R., Navarra, A.: Gathering of robots on anonymous grids without multiplicity detection. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol.\u00a07355, pp. 327\u2013338. Springer, Heidelberg (2012)"},{"key":"10_CR8","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":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-33651-5_23","volume-title":"Distributed Computing","author":"G. D\u2019Angelo","year":"2012","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: How to gather asynchronous oblivious robots on anonymous rings. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 326\u2013340. Springer, Heidelberg (2012)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model. In: Alpern, S., Fokkink, R., G\u0105sieniec, L., Lindelauf, R., Subrahmanian, V. (eds.) Search Theory: A Game Theoretic Perspective, pp. 197\u2013222. Springer (2013)","DOI":"10.1007\/978-1-4614-6825-7_13"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A., Nisse, N., Suchan, K.: A unified approach for different tasks on rings in robot-based computing systems. In: Proc. of 15th IEEE IPDPS APDCM (to appear. 2013)","DOI":"10.1109\/IPDPSW.2013.89"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Navarra, A., Nisse, N.: Robot Searching and Gathering on Rings under Minimal Assumptions, Tech. Rep. RR-8250, Inria (2013)","DOI":"10.1007\/978-3-642-45249-9_10"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Dieudonne, Y., Pelc, A., Peleg, D.: Gathering despite mischief. In: Proc. of 23rd SODA, pp. 527\u2013540 (2012)","DOI":"10.1137\/1.9781611973099.45"},{"key":"10_CR14","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)"},{"issue":"14-15","key":"10_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."},{"issue":"20","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.ipl.2011.07.018","volume":"111","author":"P. Flocchini","year":"2011","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: How many oblivious robots can explore a line. Inf. Process. Lett.\u00a0111(20), 1027\u20131031 (2011)","journal-title":"Inf. Process. Lett."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by oblivious mobile robots. Morgan and Claypool (2012)","DOI":"10.2200\/S00440ED1V01Y201208DCT010"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-46632-0_10","volume-title":"Algorithms and Computations","author":"P. Flocchini","year":"1999","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol.\u00a01741, pp. 93\u2013102. Springer, Heidelberg (1999)"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci.\u00a0399(3), 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00446-009-0089-1","volume":"22","author":"D. Ilcinkas","year":"2009","unstructured":"Ilcinkas, D., Nisse, N., Soguet, D.: The cost of monotonicity in distributed graph searching. Distributed Computing\u00a022(2), 117\u2013127 (2009)","journal-title":"Distributed Computing"},{"key":"10_CR21","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":"10_CR22","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)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-642-32589-2_48","volume-title":"Mathematical Foundations of Computer Science 2012","author":"S. Kamei","year":"2012","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Gathering an even number of robots in an odd ring without global multiplicity detection. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 542\u2013553. Springer, Heidelberg (2012)"},{"key":"10_CR24","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":"10_CR25","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":"10_CR26","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring. Morgan & Claypool (2010)","DOI":"10.2200\/S00278ED1V01Y201004DCT001"},{"key":"10_CR27","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","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45249-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T19:02:53Z","timestamp":1558810973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45249-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642452482","9783642452499"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45249-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}