{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:00Z","timestamp":1750307460847,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,25]]},"DOI":"10.1145\/1835698.1835801","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"450-459","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["How to meet when you forget"],"prefix":"10.1145","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[{"name":"Universite du Qu\u00e9bec en Outaouais, Gatineau, PQ, Canada"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[{"name":"Gda\u0144sk University of Technology, Gda\u0144sk, Poland"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[{"name":"Universite du Qu\u00e9bec en Outaouais, Gatineau, PQ, Canada"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012993249195"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.10011"},{"key":"e_1_3_2_1_3_1","volume-title":"Int. Series in Operations research and Management Science","author":"Alpern S.","year":"2002","unstructured":"S. Alpern and S. Gal , The theory of search games and rendezvous . Int. Series in Operations research and Management Science , Kluwer Academic Publisher , 2002 . S. Alpern and S. Gal, The theory of search games and rendezvous. Int. Series in Operations research and Management Science, Kluwer Academic Publisher, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1032374243"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/3214827"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276925"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.1.107.11191"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804655"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48247"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012996314130"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.1044"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301355"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209048"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.016"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118736.3118835"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.10.002"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. 6th Latin American Symposium on Theoretical Informatics (LATIN","author":"Flocchini P.","year":"2004","unstructured":"P. Flocchini , E. Kranakis , D. Krizanc , N. Santoro , C. Sawchuk, Multiple mobile agent rendezvous in a ring , Proc. 6th Latin American Symposium on Theoretical Informatics (LATIN 2004 ), 599--608. P. Flocchini, E. Kranakis, D. Krizanc, N. Santoro, C. Sawchuk, Multiple mobile agent rendezvous in a ring, Proc. 6th Latin American Symposium on Theoretical Informatics (LATIN 2004), 599--608."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/646515.695986"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696161"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684110"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_22"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_17"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810524"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.6.974"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA","author":"Gasieniec L.","year":"2007","unstructured":"L. Gasieniec , A. Pelc , T. Radzik , X. Zhang, Tree exploration with logarithmic memory , Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007 ), 585--594. L. Gasieniec, A. Pelc, T. Radzik, X. Zhang, Tree exploration with logarithmic memory, Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), 585--594."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/93385.93409"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00023-5"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780823_5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1086"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792918.1792970"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/850929.851981"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/235049.235058"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)E0133-J"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"},{"key":"e_1_3_2_1_35_1","volume-title":"The strategy of conflict","author":"Schelling T.","year":"1960","unstructured":"T. Schelling , The strategy of conflict , Oxford University Press , Oxford , 1960 . T. Schelling, The strategy of conflict, Oxford University Press, Oxford, 1960."},{"key":"e_1_3_2_1_36_1","volume-title":"Proc. 18th ACM-SIAM symposium on Discrete algorithms (SODA","author":"Ta-Shma A.","year":"2007","unstructured":"A. Ta-Shma and U. Zwick . Deterministic rendezvous, treasure hunts and strongly universal exploration sequences . Proc. 18th ACM-SIAM symposium on Discrete algorithms (SODA 2007 ), 599--608. A. Ta-Shma and U. Zwick. Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. Proc. 18th ACM-SIAM symposium on Discrete algorithms (SODA 2007), 599--608."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1992.89"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.481599"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/646250.685518"}],"event":{"name":"PODC '10: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Zurich Switzerland","acronym":"PODC '10"},"container-title":["Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835801","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835698.1835801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:24Z","timestamp":1750248504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835801"}},"subtitle":["log-space rendezvous in arbitrary graphs"],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":40,"alternative-id":["10.1145\/1835698.1835801","10.1145\/1835698"],"URL":"https:\/\/doi.org\/10.1145\/1835698.1835801","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}