{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:19Z","timestamp":1750306999182,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T00:00:00Z","timestamp":1340582400000},"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":[[2012,6,25]]},"DOI":"10.1145\/2312005.2312007","type":"proceedings-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:31:21Z","timestamp":1340803881000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Time vs. space trade-offs for rendezvous in trees"],"prefix":"10.1145","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[{"name":"University of Quebec, Hull, PQ, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[{"name":"INRIA, Talence, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[{"name":"University of Quebec, Hull, PQ, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,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","series-title":"Series in Operations research and Management Science","volume-title":"The theory of search games and rendezvous.Int","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","first-page":"839","volume":"28","author":"Anderson E.","year":"1990","unstructured":"E. Anderson and R. Weber , The rendezvous problem on discrete locations,Journal of Applied Probability 28 ( 1990 ), 839 -- 851 . E. Anderson and R. Weber,The rendezvous problem on discrete locations,Journal of Applied Probability 28 (1990), 839--851.","journal-title":"The rendezvous problem on discrete locations,Journal of Applied Probability"},{"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.1007\/978-3-642-13284-1_8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012996314130"},{"key":"e_1_3_2_1_10_1","volume-title":"Rendezvous search when marks are left at the starting points,Naval Reaserch Logistics 48","author":"Baston V.","year":"2001","unstructured":"V. Baston and S. Gal , Rendezvous search when marks are left at the starting points,Naval Reaserch Logistics 48 ( 2001 ), 722--731. V. Baston and S. Gal,Rendezvous search when marks are left at the starting points,Naval Reaserch Logistics 48 (2001), 722--731."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759323"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835801"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873604"},{"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.1007\/s00453-006-0074-2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(83)90017-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31104-8_25"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science(STACS","author":"Flocchini P.","year":"2001","unstructured":"P. Flocchini , G. Prencipe , N. Santoro , P. Widmayer , Gathering of asynchronous oblivious robots with limited visibility , Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science(STACS 2001 ), Springer LNCS 2010, 247--258. P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer, Gathering of asynchronous oblivious robots with limited visibility, Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science(STACS 2001), Springer LNCS 2010, 247--258."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_17"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810524"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud A. Pelc Delays induce an exponential memory gap for rendezvous in trees arXiv:1102.0467v1 {cs.DC}.  P. Fraigniaud A. Pelc Delays induce an exponential memory gap for rendezvous in trees arXiv:1102.0467v1 {cs.DC}.","DOI":"10.1145\/2438645.2438649"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.6.974"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/93385.93409"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780823_5"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. 8th Latin American Theoretical Informatics (LATIN","author":"Kranakis E.","year":"2008","unstructured":"E. Kranakis , D. Krizanc , and P. Morin , Randomized Rendez-Vous with Limited Memory , Proc. 8th Latin American Theoretical Informatics (LATIN 2008 ), Springer LNCS 4957, 605--616. E. Kranakis, D. Krizanc, and P. Morin,Randomized Rendez-Vous with Limited Memory, Proc. 8th Latin American Theoretical Informatics (LATIN 2008), Springer LNCS 4957, 605--616."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/850929.851981"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S036301299427816X"},{"key":"e_1_3_2_1_28_1","volume-title":"Part 1: Fundamentals.Randomness and Computation","author":"Miller G.","year":"1989","unstructured":"G. Miller , J. Reif , Parallel Tree Contraction , Part 1: Fundamentals.Randomness and Computation ( 1989 ), JAI Press , 47--72. G. Miller, J. Reif,Parallel Tree Contraction, Part 1: Fundamentals.Randomness and Computation (1989), JAI Press, 47--72."},{"key":"e_1_3_2_1_29_1","first-page":"17","volume":"84","author":"Roh K.","year":"2008","unstructured":"K. Roh , M. Crochemore , C.S. Iliopoulos , K. Park , External Memory Algorithms for String Problems , Fundamenta Informaticae 84 ( 2008 ), 17 -- 32 . K. Roh, M. Crochemore, C.S. Iliopoulos, K. Park,External Memory Algorithms for String Problems, Fundamenta Informaticae 84 (2008), 17--32.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_3_2_1_30_1","volume-title":"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_31_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1992.89"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/646250.685518"}],"event":{"name":"SPAA '12: 24th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Pittsburgh Pennsylvania USA","acronym":"SPAA '12"},"container-title":["Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312007","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2312005.2312007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:48Z","timestamp":1750236528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":32,"alternative-id":["10.1145\/2312005.2312007","10.1145\/2312005"],"URL":"https:\/\/doi.org\/10.1145\/2312005.2312007","relation":{},"subject":[],"published":{"date-parts":[[2012,6,25]]},"assertion":[{"value":"2012-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}