{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:35Z","timestamp":1746331415074,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_35","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"411-422","source":"Crossref","is-referenced-by-count":5,"title":["Fault-Tolerant Rendezvous in Networks"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"first","affiliation":[]},{"given":"Yoann","family":"Dieudonn\u00e9","sequence":"additional","affiliation":[]},{"given":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","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. on Control and Optimization\u00a033, 673\u2013683 (1995)","journal-title":"SIAM J. on Control and Optimization"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/nav.10011","volume":"49","author":"S. Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search on labelled networks. Naval Reaserch Logistics\u00a049, 256\u2013274 (2002)","journal-title":"Naval Reaserch Logistics"},{"key":"35_CR3","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science. Kluwer Academic Publisher (2002)"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"839","DOI":"10.2307\/3214827","volume":"28","author":"E. Anderson","year":"1990","unstructured":"Anderson, E., Weber, R.: The rendezvous problem on discrete locations. Journal of Applied Probability\u00a028, 839\u2013851 (1990)","journal-title":"Journal of Applied Probability"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proc. 14th Annual ACM Symp. on Computational Geometry, pp. 365\u2013373 (1998)","DOI":"10.1145\/276884.276925"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/opre.49.1.107.11191","volume":"49","author":"E. Anderson","year":"2001","unstructured":"Anderson, E., Fekete, S.: Two-dimensional rendezvous search. Operations Research\u00a049, 107\u2013118 (2001)","journal-title":"Operations Research"},{"key":"35_CR7","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":"35_CR8","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1137\/S0363012996314130","volume":"36","author":"V. Baston","year":"1998","unstructured":"Baston, V., Gal, S.: Rendezvous on the line when the players\u2019 initial distance is given by an unknown probability distribution. SIAM J. on Control and Opt.\u00a036, 1880\u20131889 (1998)","journal-title":"SIAM J. on Control and Opt."},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1002\/nav.1044","volume":"48","author":"V. Baston","year":"2001","unstructured":"Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Naval Reaserch Logistics\u00a048, 722\u2013731 (2001)","journal-title":"Naval Reaserch Logistics"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S., Widmayer, P.: Deterministic symmetric rendezvous in arbitrary graphs: Overcoming anonymity, failures and uncertainty. In: Alpern, S., et al. (eds.) Search Theory: A Game Theoretic Perspective, pp. 175\u2013195. Springer (2013)","DOI":"10.1007\/978-1-4614-6825-7_12"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M. Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: Gathering. SIAM J. Comput.\u00a041, 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"key":"35_CR12","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. Distributed Computing\u00a025, 165\u2013178 (2012)","journal-title":"Distributed Computing"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms\u00a08 (2012)","DOI":"10.1145\/2344422.2344427"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-77444-0_29","volume-title":"Distributed Computing and Networking","author":"S. Das","year":"2008","unstructured":"Das, S.: Mobile Agent Rendezvous in a Ring Using Faulty Tokens. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol.\u00a04904, pp. 292\u2013297. Springer, Heidelberg (2008)"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-92221-6_29","volume-title":"Principles of Distributed Systems","author":"S. Das","year":"2008","unstructured":"Das, S., Mihal\u00e1k, M., \u0160r\u00e1mek, R., Vicari, E., Widmayer, P.: Rendezvous of Mobile Agents When Tokens Fail Anytime. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 463\u2013480. Springer, Heidelberg (2008)"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G. Marco De","year":"2006","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theoretical Computer Science\u00a0355, 315\u2013326 (2006)","journal-title":"Theoretical Computer Science"},{"key":"35_CR17","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":"35_CR18","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.ipl.2012.03.017","volume":"112","author":"Y. Dieudonn\u00e9","year":"2012","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Deterministic network exploration by a single agent with Byzantine tokens. Information Processing Letters\u00a0112, 467\u2013470 (2012)","journal-title":"Information Processing Letters"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Peleg, D.: Gathering despite mischief. In: Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 527\u2013540 (2012)","DOI":"10.1137\/1.9781611973099.45"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proc. 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2013), pp. 92\u201399 (2013)","DOI":"10.1145\/2484239.2484245"},{"key":"35_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-27796-5_15","volume-title":"Structural Information and Communication Complexity","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., An, H.-C., Krizanc, D., Luccio, F.L., Santoro, N., Sawchuk, C.: Mobile Agents Rendezvous When Tokens Fail. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 161\u2013172. Springer, Heidelberg (2004)"},{"key":"35_CR22","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. Theoretical Computer Science\u00a0337, 147\u2013168 (2005)","journal-title":"Theoretical Computer Science"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Transactions on Algorithms\u00a09, article 17 (2013)","DOI":"10.1145\/2438645.2438649"},{"key":"35_CR24","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self stabilizing mutual exclusion. In: Proc. 9th Annual ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 119\u2013131 (1990)","DOI":"10.1145\/93385.93409"},{"key":"35_CR25","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/S0022-0000(02)00023-5","volume":"65","author":"M. Kouck\u00fd","year":"2002","unstructured":"Kouck\u00fd, M.: Universal traversal sequences with backtracking. Journal of Computer and System Sciences\u00a065, 717\u2013726 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11780823_5","volume-title":"Structural Information and Communication Complexity","author":"D.R. Kowalski","year":"2006","unstructured":"Kowalski, D.R., Malinowski, A.: How to Meet in Anonymous Network. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 44\u201358. Springer, Heidelberg (2006)"},{"key":"35_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-78773-0_52","volume-title":"LATIN 2008: Theoretical Informatics","author":"E. Kranakis","year":"2008","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized Rendez-Vous with Limited Memory. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 605\u2013616. Springer, Heidelberg (2008)"},{"key":"35_CR28","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proc. 23rd Int. Conference on Distributed Computing Systems (ICDCS 2003), pp. 592\u2013599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"35_CR29","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1137\/S036301299427816X","volume":"34","author":"W. Lim","year":"1996","unstructured":"Lim, W., Alpern, S.: Minimax rendezvous on the line. SIAM J. on Control and Optimization\u00a034, 1650\u20131665 (1996)","journal-title":"SIAM J. on Control and Optimization"},{"key":"35_CR30","unstructured":"Lynch, N.L.: Distributed algorithms, Morgan Kaufmann Publ. Inc., San Francisco (1996)"},{"key":"35_CR31","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\u00a059, 331\u2013347 (2012)","journal-title":"Networks"},{"key":"35_CR32","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. Journal of the ACM\u00a055 (2008)","DOI":"10.1145\/1391289.1391291"},{"key":"35_CR33","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599\u2013608 (2007)"},{"key":"35_CR34","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1057\/jors.1992.89","volume":"43","author":"L. Thomas","year":"1992","unstructured":"Thomas, L.: Finding your kids when they are lost. Journal on Operational Res. Soc.\u00a043, 637\u2013639 (1992)","journal-title":"Journal on Operational Res. Soc."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:23:36Z","timestamp":1746264216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}