{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:01:11Z","timestamp":1783576871855,"version":"3.55.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"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":[[2012,5]]},"DOI":"10.1007\/s00446-011-0141-9","type":"journal-article","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T15:21:07Z","timestamp":1320247267000},"page":"165-178","source":"Crossref","is-referenced-by-count":76,"title":["How to meet when you forget: log-space rendezvous in arbitrary graphs"],"prefix":"10.1007","volume":"25","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,11,1]]},"reference":[{"key":"141_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":"141_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":"141_CR3","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":"141_CR4","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. In: International Series in Operations Research and Management Science. Kluwer Academic Publisher, Dordrecht (2002)"},{"key":"141_CR5","doi-asserted-by":"crossref","unstructured":"Ambuhl, C., Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(2), paper no. 17 (2011)","DOI":"10.1145\/1921659.1921663"},{"key":"141_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":"141_CR7","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proceedings of the 14th Annual ACM Symposium on Computational Geometry (1998)","DOI":"10.1145\/276884.276925"},{"key":"141_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":"141_CR9","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on the Theory of Computing (STOC), pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"141_CR10","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"Attiya H., Snir M., Warmuth M.: Computing on an anonymous ring. J. ACM 35, 845\u2013875 (1988)","journal-title":"J. ACM"},{"key":"141_CR11","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":"141_CR12","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":"141_CR13","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing (PODC), pp. 181\u2013188 (1999)","DOI":"10.1145\/301308.301355"},{"key":"141_CR14","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1137\/0209048","volume":"9","author":"S.A. Cook","year":"1980","unstructured":"Cook S.A., Rackoff C.: Space lower bounds for maze threadability on restricted machines. SIAM J. Comput. 9, 636\u2013652 (1980)","journal-title":"SIAM J. Comput."},{"key":"141_CR15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G. De Marco","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":"141_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":"141_CR17","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","volume":"51","author":"K. Diks","year":"2004","unstructured":"Diks K., Fraigniaud P., Kranakis E., Pelc A.: Tree exploration with little memory. J. Algorithms 51, 38\u201363 (2004)","journal-title":"J. Algorithms"},{"key":"141_CR18","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple mobile agent rendezvous in a ring. In: Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN), pp. 599\u2013608 (2004)","DOI":"10.1007\/978-3-540-24698-5_62"},{"issue":"1\u20133","key":"141_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 oblivious robots with limited visibility. Theor. Comput. Sci. 337(1\u20133), 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"141_CR20","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pp. 757\u2013772 (2001)","DOI":"10.1007\/3-540-48224-5_62"},{"key":"141_CR21","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: A space lower bound for routing in trees. In: Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 65\u201375 (2002)","DOI":"10.1007\/3-540-45841-7_4"},{"key":"141_CR22","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D.: Digraphs exploration with little memory. In: Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science (STACS), pp. 246\u2013257 (2004)","DOI":"10.1007\/978-3-540-24749-4_22"},{"key":"141_CR23","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: Proceedings of the 22nd International Symposium on Distributed Computing (DISC), pp. 242\u2013256 (2008)","DOI":"10.1007\/978-3-540-87779-0_17"},{"key":"141_CR24","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2010)","DOI":"10.1145\/1810479.1810524"},{"key":"141_CR25","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ArXiv: 1102.0467v1 (2011)","DOI":"10.1145\/1810479.1810524"},{"key":"141_CR26","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":"141_CR27","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self stabilizing mutual exclusion. In: Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 119\u2013131 (1990)","DOI":"10.1145\/93385.93409"},{"key":"141_CR28","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/S0022-0000(02)00023-5","volume":"65","author":"M. Kouck\u1ef3","year":"2002","unstructured":"Kouck\u1ef3 M.: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65, 717\u2013726 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20132","key":"141_CR29","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(1\u20132), 141\u2013156 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"141_CR30","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1006\/inco.1994.1086","volume":"114","author":"E. Kranakis","year":"1994","unstructured":"Kranakis E., Krizanc D., van der Berg J.: Computing Boolean functions on anonymous networks. Inf. Comput. 114, 214\u2013236 (1994)","journal-title":"Inf. Comput."},{"key":"141_CR31","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized rendez-vous with limited memory. In: Proceedings of the 8th Latin American Theoretical Informatics (LATIN), pp. 605\u2013616 (2008)","DOI":"10.1007\/978-3-540-78773-0_52"},{"key":"141_CR32","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS), pp. 592\u2013599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"141_CR33","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":"141_CR34","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0166-218X(93)E0133-J","volume":"56","author":"N. Norris","year":"1995","unstructured":"Norris N.: Universal covers of graphs: isomorphism to depth N-1 implies isomorphism to all depths. Discret. Appl. Math. 56, 61\u201374 (1995)","journal-title":"Discret. Appl. Math."},{"key":"141_CR35","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55, 1\u201324 (2008)","DOI":"10.1145\/1391289.1391291"},{"key":"141_CR36","volume-title":"The Strategy of Conflict","author":"T. Schelling","year":"1960","unstructured":"Schelling T.: The Strategy of Conflict. Oxford University Press, Oxford (1960)"},{"key":"141_CR37","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proceedings of the 18th ACM-SIAM symposium on Discrete algorithms (SODA), pp. 599\u2013608 (2007)"},{"key":"141_CR38","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":"141_CR39","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"key":"141_CR40","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita M., Kameda T.: Computing on anonymous networks: part I-characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"141_CR41","doi-asserted-by":"crossref","unstructured":"Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), 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-011-0141-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-011-0141-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0141-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T18:03:26Z","timestamp":1741889006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-011-0141-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,1]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["141"],"URL":"https:\/\/doi.org\/10.1007\/s00446-011-0141-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,1]]}}}