{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:26Z","timestamp":1750306646424,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"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":[[2014,7,15]]},"DOI":"10.1145\/2611462.2611473","type":"proceedings-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T12:20:56Z","timestamp":1405426856000},"page":"282-290","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Time versus cost tradeoffs for deterministic rendezvous in networks"],"prefix":"10.1145","author":[{"given":"Avery","family":"Miller","sequence":"first","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, PQ, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, PQ, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979732428X"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.34"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012993249195"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.10011"},{"key":"e_1_3_2_1_5_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_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921659.1921663"},{"key":"e_1_3_2_1_7_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_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276925"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.1.107.11191"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00054-U"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)89161-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/225298.225337"},{"key":"e_1_3_2_1_13_1","volume-title":"24th International Symposium on Distributed Computing (DISC","author":"Bampas E.","year":"2010","unstructured":"E. Bampas , J. Czyzowicz , L. Gasieniec , D. Ilcinkas , A. Labourel, Almost optimal asynchronous rendezvous in infinite multidimensional grids,Proc . 24th International Symposium on Distributed Computing (DISC 2010 ), 297--311. E. Bampas, J. Czyzowicz, L. Gasieniec, D. Ilcinkas, A. Labourel, Almost optimal asynchronous rendezvous in infinite multidimensional grids,Proc. 24th International Symposium on Distributed Computing (DISC 2010), 297--311."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012996314130"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.1044"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276759"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365703"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993411"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1940234.1940248"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/100796534"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0141-9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344422.2344427"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199911)32:3%26lt;%26gt;1.0.CO;2-F"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.016"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_46"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-0074-2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.07.031"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_45"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484245"},{"key":"e_1_3_2_1_30_1","volume-title":"12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA","author":"Duncan C.A.","year":"2001","unstructured":"C.A. Duncan , S.G. Kobourov and V.S.A. Kumar ,Optimal constrained graph exploration,Proc . 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001 ), 807--814. C.A. Duncan, S.G. Kobourov and V.S.A. Kumar,Optimal constrained graph exploration,Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), 807--814."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_4"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.01.001"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v48:3"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2438645.2438649"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207017"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/93385.93409"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.010"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792918.1792970"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/850929.851981"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S036301299427816X"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1043"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21453"},{"key":"e_1_3_2_1_43_1","first-page":"39","volume":"7","author":"Redei L.","year":"1934","unstructured":"L. Redei , Ein kombinatorischer Satz , Acta Litteraria Szeged 7 ( 1934 ), 39 -- 43 . L. Redei, Ein kombinatorischer Satz, Acta Litteraria Szeged 7 (1934), 39--43.","journal-title":"Acta Litteraria Szeged"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"},{"key":"e_1_3_2_1_45_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_46_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1992.89"}],"event":{"name":"PODC '14: 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":"Paris France","acronym":"PODC '14"},"container-title":["Proceedings of the 2014 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611473","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2611462.2611473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:05Z","timestamp":1750229765000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":46,"alternative-id":["10.1145\/2611462.2611473","10.1145\/2611462"],"URL":"https:\/\/doi.org\/10.1145\/2611462.2611473","relation":{},"subject":[],"published":{"date-parts":[[2014,7,15]]},"assertion":[{"value":"2014-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}