{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:25:56Z","timestamp":1747866356098,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_2","type":"book-chapter","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T23:30:06Z","timestamp":1507246206000},"page":"18-32","source":"Crossref","is-referenced-by-count":4,"title":["Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs"],"prefix":"10.1007","author":[{"given":"Fukuhito","family":"Ooshita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajoy K.","family":"Datta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Blin, L., Potop-Butucaru, M.G., Tixeuil, S.: On the self-stabilization of mobile robots in graphs. In: Proceedings of 15th International Conference on Principles of Distributed systems, pp. 301\u2013314 (2007)","DOI":"10.1007\/978-3-540-77096-1_22"},{"issue":"6","key":"2_CR2","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s00446-016-0276-9","volume":"29","author":"S Bouchard","year":"2016","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Ducourthial, B.: Byzantine gathering in networks. Distrib. Comput. 29(6), 435\u2013457 (2016)","journal-title":"Distrib. Comput."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00446-015-0259-2","volume":"29","author":"J Chalopin","year":"2016","unstructured":"Chalopin, J., Dieudonn\u00e9, Y., Labourel, A., Pelc, A.: Rendezvous in networks in spite of delay faults. Distrib. Comput. 29, 187\u2013205 (2016)","journal-title":"Distrib. Comput."},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-011-0141-9","volume":"25","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25(2), 165\u2013178 (2012)","journal-title":"Distrib. Comput."},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00446-013-0201-4","volume":"27","author":"J Czyzowicz","year":"2014","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: Time versus space trade-offs for rendezvous in trees. Distrib. Comput. 27(2), 95\u2013109 (2014)","journal-title":"Distrib. Comput."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00446-016-0274-y","volume":"30","author":"G D\u2019Angelo","year":"2017","unstructured":"D\u2019Angelo, G., Navarra, A., Nisse, N.: A unified approach for gathering and exclusive searching on rings under weak assumptions. Distrib. Comput. 30(1), 17\u201348 (2017)","journal-title":"Distrib. Comput."},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00446-014-0212-9","volume":"27","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., Stefano, G.D., Navarra, A.: Gathering on rings under the look-compute-move model. Distrib. Comput. 27(4), 255\u2013285 (2014)","journal-title":"Distrib. Comput."},{"key":"2_CR8","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.R., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69\u201396 (2006)","journal-title":"Algorithmica"},{"issue":"1","key":"2_CR9","first-page":"1:1","volume":"11","author":"Y Dieudonn\u00e9","year":"2014","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Peleg, D.: Gathering despite mischief. ACM Tran. Algorithms 11(1), 1:1\u20131:28 (2014)","journal-title":"ACM Tran. Algorithms"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2011.12.010","volume":"428","author":"Y Dieudonn\u00e9","year":"2012","unstructured":"Dieudonn\u00e9, Y., Petit, F.: Self-stabilizing gathering with strong multiplicity detection. Theoret. Comput. Sci. 428, 47\u201357 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"2_CR11","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2438645.2438649","volume":"9","author":"P Fraigniaud","year":"2013","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9(2), 17:1\u201317:24 (2013)","journal-title":"ACM Trans. Algorithms"},{"key":"2_CR13","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. Theoret. Comput. Sci. 390, 27\u201339 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2008.02.010","volume":"399","author":"DR Kowalski","year":"2008","unstructured":"Kowalski, D.R., Malinowski, A.: How to meet in anonymous network. Theoret. Comput. Sci. 399, 141\u2013156 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"14\u201315","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1016\/j.tcs.2010.01.006","volume":"411","author":"T Masuzawa","year":"2010","unstructured":"Masuzawa, T., Tixeuil, S.: Quiescence of self-stabilizing gossiping among mobile agents in graphs. Theoret. Comput. Sci. 411(14\u201315), 1567\u20131582 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331\u2013347 (2012)","journal-title":"Networks"},{"key":"2_CR17","unstructured":"Pelc, A.: Deterministic gathering with crash faults. CoRR abs\/1704.08880 (2017). \nhttp:\/\/arxiv.org\/abs\/1704.08880"},{"issue":"4","key":"2_CR18","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. 28(4), 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/2601068","volume":"10","author":"A Ta-Shma","year":"2014","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms 10(3), 12:1\u201312:15 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-319-53925-6_9","volume-title":"WALCOM: Algorithms and Computation","author":"Masashi Tsuchida","year":"2017","unstructured":"Tsuchida, M., Ooshita, F., Inoue, M.: Byzantine gathering in networks with authenticated whiteboards. In: Proceedings of 11th International Conference and Workshops on Algorithms and Computation, pp. 106\u2013118 (2017)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69084-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T08:04:20Z","timestamp":1531296260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}