{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:13Z","timestamp":1750306993676,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T00:00:00Z","timestamp":1374451200000},"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":[[2013,7,22]]},"DOI":"10.1145\/2484239.2484245","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"92-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["How to meet asynchronously at polynomial cost"],"prefix":"10.1145","author":[{"given":"Yoann","family":"Dieudonn\u00e9","sequence":"first","affiliation":[{"name":"Laboratoire MIS, Universit\u00e9 de Picardie Jules Verne, AMIENS, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[{"name":"D\u00e9partement d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, GATINEAU, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Villain","sequence":"additional","affiliation":[{"name":"Laboratoire MIS, Universit\u00e9 de Picardie Jules Verne, AMIENS, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79158"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/050645221"},{"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.1239\/jap\/1032374243"},{"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","volume-title":"Proc. 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 ), LNCS 6343, 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), LNCS 6343, 297--311."},{"key":"e_1_3_2_1_11_1","volume-title":"Rendezvous search when marks are left at the starting points,Naval Research Logistics 48","author":"Baston V.","year":"2001","unstructured":"V. Baston and S. Gal , Rendezvous search when marks are left at the starting points,Naval Research Logistics 48 ( 2001 ), 722--731. V. Baston and S. Gal,Rendezvous search when marks are left at the starting points,Naval Research Logistics 48 (2001), 722--731."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1940234.1940248"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759323"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446475"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/060665257"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880999.1881054"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"J. Czyzowicz A. Kosowski and A. Pelc How to meet when you forget: Log-space rendezvous in arbitrary graphs Distributed Computing 25 165--178 (2012)  J. Czyzowicz A. Kosowski and A. Pelc How to meet when you forget: Log-space rendezvous in arbitrary graphs Distributed Computing 25 165--178 (2012)","DOI":"10.1007\/s00446-011-0141-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344422.2344427"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.016"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-0074-2"},{"key":"e_1_3_2_1_21_1","volume-title":"Anonymous Meeting in Networks, Proc. 24rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA","author":"Dieudonn\u00e9 Y.","year":"2013","unstructured":"Y. Dieudonn\u00e9 , A. Pelc , Anonymous Meeting in Networks, Proc. 24rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013 ), 737--747. Y. Dieudonn\u00e9, A. Pelc, Anonymous Meeting in Networks, Proc. 24rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 737--747."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095161"},{"volume-title":"18th Annual Symposium on Theoretical Aspects of Computer Science(STACS 2001),Springer LNCS 2010, 247--258","author":"Flocchini P.","key":"e_1_3_2_1_23_1","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_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90180-5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_17"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810524"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29344-3_31"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_29"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780823_5"},{"key":"e_1_3_2_1_30_1","volume-title":"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_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.1137\/S036301299427816X"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21453"},{"key":"e_1_3_2_1_34_1","volume-title":"Morgan Kaufmann Publ","author":"Lynch N.L.","year":"1996","unstructured":"N.L. Lynch , Distributed algorithms , Morgan Kaufmann Publ . Inc.,San Francisco, USA , 1996 . N.L. Lynch, Distributed algorithms, Morgan Kaufmann Publ. Inc.,San Francisco, USA, 1996."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"},{"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.5555\/646250.685518"}],"event":{"name":"PODC '13: 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":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"PODC '13"},"container-title":["Proceedings of the 2013 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484239.2484245","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2484239.2484245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:41Z","timestamp":1750236521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484239.2484245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,22]]},"references-count":37,"alternative-id":["10.1145\/2484239.2484245","10.1145\/2484239"],"URL":"https:\/\/doi.org\/10.1145\/2484239.2484245","relation":{},"subject":[],"published":{"date-parts":[[2013,7,22]]},"assertion":[{"value":"2013-07-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}