{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T09:10:09Z","timestamp":1746090609448,"version":"3.40.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,23]],"date-time":"2013-12-23T00:00:00Z","timestamp":1387756800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00446-013-0201-4","type":"journal-article","created":{"date-parts":[[2013,12,22]],"date-time":"2013-12-22T05:14:59Z","timestamp":1387689299000},"page":"95-109","source":"Crossref","is-referenced-by-count":12,"title":["Time versus space trade-offs for rendezvous in trees"],"prefix":"10.1007","volume":"27","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,23]]},"reference":[{"key":"201_CR1","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":"201_CR2","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":"201_CR3","volume-title":"The Theory of Search Games and Rendezvous. Int. Series in Operations Research and Management Science","author":"S Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Int. Series in Operations Research and Management Science. Kluwer, Dordrecht (2002)"},{"key":"201_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1239\/jap\/1032374243","volume":"36","author":"J Alpern","year":"1999","unstructured":"Alpern, J., Baston, V., Essegaier, S.: Rendezvous search on a graph. J. Appl. Probab. 36, 223\u2013231 (1999)","journal-title":"J. Appl. Probab."},{"key":"201_CR5","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C., Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(2), article 17 (2011)","DOI":"10.1145\/1921659.1921663"},{"key":"201_CR6","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":"201_CR7","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proceedings 14th Annual ACM Symposium on Computational Geometry, pp. 365\u2013373 (1998)","DOI":"10.1145\/276884.276925"},{"key":"201_CR8","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":"201_CR9","doi-asserted-by":"crossref","unstructured":"Baba, D., Izumi, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Space-optimal rendezvous of mobile agents in asynchronous trees. In: Proceedings 17th International Colloquium on Structural Information and Comm. Complexity, (SIROCCO 2010), LNCS 6058, pp. 86\u2013100 (2010)","DOI":"10.1007\/978-3-642-13284-1_8"},{"key":"201_CR10","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":"201_CR11","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":"201_CR12","doi-asserted-by":"crossref","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Proceedings 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), pp. 1181\u20131196. (2003)","DOI":"10.1007\/3-540-45061-0_90"},{"key":"201_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":"201_CR14","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8, article 37 (2012)","DOI":"10.1145\/2344422.2344427"},{"key":"201_CR15","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":"201_CR16","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":"201_CR17","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"JP Duval","year":"1983","unstructured":"Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms 4, 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"key":"201_CR18","doi-asserted-by":"crossref","unstructured":"Elouasbi, S., Pelc, A.: Time of anonymous rendezvous in trees: Determinism vs. randomization. In: Proceedings 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), LNCS 7355, pp. 291\u2013302 (2012)","DOI":"10.1007\/978-3-642-31104-8_25"},{"key":"201_CR19","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":"201_CR20","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: Proceedings 22nd International Symposium on Distributed Computing (DISC 2008), LNCS 5218, pp. 242\u2013256 (2008)","DOI":"10.1007\/978-3-540-87779-0_17"},{"key":"201_CR21","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. In: Proceedings 22nd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2010), pp. 224\u2013232 (2010)","DOI":"10.1145\/1810479.1810524"},{"key":"201_CR22","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9(2), article 17 (2013)","DOI":"10.1145\/2438645.2438649"},{"key":"201_CR23","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1287\/opre.47.6.974","volume":"47","author":"S Gal","year":"1999","unstructured":"Gal, S.: Rendezvous search on the line. Oper. Res. 47, 974\u2013976 (1999)","journal-title":"Oper. Res."},{"key":"201_CR24","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self stabilizing mutual exclusion. In: Proceedings 9th Annual ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 119\u2013131. (1990)","DOI":"10.1145\/93385.93409"},{"key":"201_CR25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.tcs.2008.02.010","volume":"399","author":"D Kowalski","year":"2008","unstructured":"Kowalski, D., Malinowski, A.: How to meet in anonymous network. Theor. Comput. Sci. 399, 141\u2013156 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"201_CR26","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized rendezvous with limited memory. ACM Trans. Algorithms 7(3), article 34 (2011)","DOI":"10.1145\/1978782.1978789"},{"key":"201_CR27","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proceedings 23rd International Conference on Distributed Computing Systems (ICDCS 2003), IEEE, pp. 592\u2013599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"201_CR28","doi-asserted-by":"crossref","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. Control Optim. 34, 1650\u20131665 (1996)","journal-title":"SIAM J. Control Optim."},{"key":"201_CR29","unstructured":"Miller, G.L., Reif, J.H.: Parallel tree contraction part 1: Fundamentals. In: Micali, S. (ed.) Randomness and Computation, Vol. 5, pp. 47\u201372. JAI Press, Greenwich, Connecticut (1989)"},{"key":"201_CR30","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":"201_CR31","first-page":"17","volume":"84","author":"K Roh","year":"2008","unstructured":"Roh, K., Crochemore, M., Iliopoulos, C.S., Park, K.: External memory algorithms for string problems. Fundam. Inform. 84, 17\u201332 (2008)","journal-title":"Fundam. Inform."},{"key":"201_CR32","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proceedings 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599\u2013608 (2007)"},{"key":"201_CR33","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."},{"key":"201_CR34","doi-asserted-by":"crossref","unstructured":"Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Proceedings International Colloquium on Automata, Languages, and Programming (ICALP 1996), LNCS 1099, pp. 610\u2013621 (1996)","DOI":"10.1007\/3-540-61440-0_163"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0201-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-013-0201-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0201-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T08:42:32Z","timestamp":1746088952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-013-0201-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,23]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s00446-013-0201-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2013,12,23]]}}}