{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:29Z","timestamp":1759638209229,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,11,25]],"date-time":"2015-11-25T00:00:00Z","timestamp":1448409600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (CA)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s00446-015-0259-2","type":"journal-article","created":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T18:49:23Z","timestamp":1448390963000},"page":"187-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Rendezvous in networks in spite of delay faults"],"prefix":"10.1007","volume":"29","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","published-online":{"date-parts":[[2015,11,25]]},"reference":[{"key":"259_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0304-4149(91)90090-Y","volume":"38","author":"DJ Aldous","year":"1991","unstructured":"Aldous, D.J.: Meeting times for independent Markov chains. Stoch. Process. Appl. 38, 185\u2013193 (1991)","journal-title":"Stoch. Process. Appl."},{"key":"259_CR2","doi-asserted-by":"crossref","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. 33, 673\u2013683 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"259_CR3","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1002\/nav.10011","volume":"49","author":"S Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search on labelled networks. Nav. Res. Logist. 49, 256\u2013274 (2002)","journal-title":"Nav. Res. Logist."},{"key":"259_CR4","volume-title":"The Theory of Search Games and Rendezvous. International Series in Operations Research and Management Science","author":"S Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. International Series in Operations Research and Management Science. Kluwer, Dordrecht (2002)"},{"key":"259_CR5","doi-asserted-by":"crossref","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. J. Appl. Probab. 28, 839\u2013851 (1990)","journal-title":"J. Appl. Probab."},{"key":"259_CR6","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proceedings of 14th Annual ACM Symposium on Computational Geometry, pp. 365\u2013373 (1998)","DOI":"10.1145\/276884.276925"},{"key":"259_CR7","doi-asserted-by":"crossref","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. Oper. Res. 49, 107\u2013118 (2001)","journal-title":"Oper. Res."},{"key":"259_CR8","doi-asserted-by":"crossref","unstructured":"Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Proceedings of 24th International Symposium on Distributed Computing (DISC 2010), pp. 297\u2013311","DOI":"10.1007\/978-3-642-15763-9_28"},{"key":"259_CR9","doi-asserted-by":"crossref","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. Control Optim. 36, 1880\u20131889 (1998)","journal-title":"SIAM J. Control Optim."},{"key":"259_CR10","doi-asserted-by":"crossref","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. Nav. Res. Logist. 48, 722\u2013731 (2001)","journal-title":"Nav. Res. Logist."},{"key":"259_CR11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-1-4614-6825-7_12","volume-title":"Search Theory: A Game Theoretic Perspective","author":"J Chalopin","year":"2013","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, Berlin (2013)"},{"key":"259_CR12","doi-asserted-by":"crossref","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. 41, 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"key":"259_CR13","doi-asserted-by":"crossref","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, 165\u2013178 (2012)","journal-title":"Distrib. Comput."},{"key":"259_CR14","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4), 37 (2012)","DOI":"10.1145\/2344422.2344427"},{"key":"259_CR15","doi-asserted-by":"crossref","unstructured":"Das, S.: Mobile agent rendezvous in a ring using faulty tokens. In: Proceedings of 9th International Conference on Distributed Computing and Networking (ICDCN 2008), pp. 292\u2013297","DOI":"10.1007\/978-3-540-77444-0_29"},{"key":"259_CR16","doi-asserted-by":"crossref","unstructured":"Das, S., Mihalak, M., Sramek, R., Vicari, E., Widmayer, P.: Rendezvous of mobile agents when tokens fail anytime. In: Proceedings of 12th International Conference on Principles of Distributed Systems (OPODIS 2008), pp. 463\u2013480","DOI":"10.1007\/978-3-540-92221-6_29"},{"key":"259_CR17","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 355, 315\u2013326 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"259_CR18","doi-asserted-by":"crossref","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 46, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"259_CR19","doi-asserted-by":"crossref","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. Inf. Process. Lett. 112, 467\u2013470 (2012)","journal-title":"Inf. Process. Lett."},{"key":"259_CR20","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Peleg, D.: Gathering despite mischief. ACM Trans. Algorithms 11(1), 1 (2014)","DOI":"10.1145\/2629656"},{"key":"259_CR21","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1137\/130931990","volume":"44","author":"Y Dieudonn\u00e9","year":"2015","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44, 844\u2013867 (2015)","journal-title":"SIAM J. Comput."},{"key":"259_CR22","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F.L., Santoro, N., Sawchuk, C.: Mobile agents rendezvous when tokens fail. In: Proceedings of 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), pp. 161\u2013172","DOI":"10.1007\/978-3-540-27796-5_15"},{"key":"259_CR23","doi-asserted-by":"crossref","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. 337, 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"259_CR24","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9(2), 17 (2013)","DOI":"10.1145\/2438645.2438649"},{"key":"259_CR25","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self stabilizing mutual exclusion. In: Proceedings of 9th Annual ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 119\u2013131","DOI":"10.1145\/93385.93409"},{"key":"259_CR26","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 65, 717\u2013726 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"259_CR27","doi-asserted-by":"crossref","unstructured":"Kowalski, D., Malinowski, A.: How to meet in anonymous network. In: Proceedings of 13th International Colloquium on Structural Information and Communication Complexity, (SIROCCO 2006), pp. 44\u201358","DOI":"10.1007\/11780823_5"},{"key":"259_CR28","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized rendez-vous with limited memory. In: Proceedings of 8th Latin American Theoretical Informatics (LATIN 2008), pp. 605\u2013616","DOI":"10.1007\/978-3-540-78773-0_52"},{"key":"259_CR29","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proceedings of 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592\u2013599","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"259_CR30","doi-asserted-by":"crossref","unstructured":"Lim, W., Alpern, S.: Minimax rendezvous on the line. SIAM J. Control Optim. 34, 1650\u20131665 (1996)","DOI":"10.1137\/S036301299427816X"},{"key":"259_CR31","volume-title":"Distributed Algorithms","author":"NL Lynch","year":"1996","unstructured":"Lynch, N.L.: Distributed Algorithms. Morgan Kaufmann Publ. Inc., San Francisco (1996)"},{"key":"259_CR32","doi-asserted-by":"crossref","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":"259_CR33","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17 (2008)","DOI":"10.1145\/1391289.1391291"},{"key":"259_CR34","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599\u2013608","DOI":"10.1145\/2601068"},{"key":"259_CR35","doi-asserted-by":"crossref","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. J. Oper. Res. Soc. 43, 637\u2013639 (1992)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-015-0259-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-015-0259-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-015-0259-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:26:46Z","timestamp":1559122006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-015-0259-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,25]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["259"],"URL":"https:\/\/doi.org\/10.1007\/s00446-015-0259-2","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2015,11,25]]}}}