{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:51:31Z","timestamp":1742917891701,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460177"},{"type":"electronic","value":"9783662460184"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46018-4_5","type":"book-chapter","created":{"date-parts":[[2015,1,3]],"date-time":"2015-01-03T14:51:00Z","timestamp":1420296660000},"page":"75-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast Rendezvous with Advice"],"prefix":"10.1007","author":[{"given":"Avery","family":"Miller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,4]]},"reference":[{"key":"5_CR1","series-title":"International Series in Operations research and Management Science","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. International Series in Operations research and Management Science. Springer, New York (2002)"},{"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, pp. 365\u2013373 (1998)","key":"5_CR2","DOI":"10.1145\/276884.276925"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-15763-9_28","volume-title":"Distributed Computing","author":"E Bampas","year":"2010","unstructured":"Bampas, E., Czyzowicz, J., G\u0105sieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 297\u2013311. Springer, Heidelberg (2010)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41, 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1383369.1383373","volume":"4","author":"R Cohen","year":"2008","unstructured":"Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms 4, 1\u201318 (2008)","journal-title":"ACM Trans. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8 (2012). article 37","key":"5_CR6","DOI":"10.1145\/2344422.2344427"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jpdc.2011.10.004","volume":"72","author":"D Dereniowski","year":"2012","unstructured":"Dereniowski, D., Pelc, A.: Drawing maps with advice. J. Parallel Distrib. Comput. 72, 132\u2013143 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR8","doi-asserted-by":"publisher","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"},{"doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proceedings of the 32nd ACM Symposium on Principles of Distributed Computing (PODC 2013), pp. 92\u201399 (2013)","key":"5_CR9","DOI":"10.1145\/2484239.2484245"},{"key":"5_CR10","first-page":"57","volume":"31","author":"R Ellis","year":"1976","unstructured":"Ellis, R.: Volume of an N-simplex by multiple integration. Elem. Math. 31, 57\u201359 (1976)","journal-title":"Elem. Math."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","volume":"412","author":"Y Emek","year":"2011","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Rosen, A.: Online computation with advice. Theor. Comput. Sci. 412, 2642\u20132656 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.jcss.2009.07.002","volume":"76","author":"P Fraigniaud","year":"2010","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Communication algorithms with advice. J. Comput. Syst. Sci. 76, 222\u2013232 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.ic.2008.07.005","volume":"206","author":"P Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with advice. Inf. Comput. 206, 1276\u20131287 (2008)","journal-title":"Inf. Comput."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1007\/s00224-010-9280-9","volume":"47","author":"P Fraigniaud","year":"2010","unstructured":"Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. Theor. Comput. Syst. 47, 920\u2013933 (2010)","journal-title":"Theor. Comput. Syst."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s00453-009-9361-9","volume":"60","author":"E Fusco","year":"2011","unstructured":"Fusco, E., Pelc, A.: Trade-offs between the size of advice and broadcasting time in trees. Algorithmica 60, 719\u2013734 (2011)","journal-title":"Algorithmica"},{"key":"5_CR16","volume-title":"Algorithmic Graph Theory","author":"A Gibbons","year":"1985","unstructured":"Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1985)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/S0097539703433912","volume":"34","author":"M Katz","year":"2004","unstructured":"Katz, M., Katz, N., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. SIAM J. Comput. 34, 23\u201340 (2004)","journal-title":"SIAM J. Comput."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","volume":"22","author":"A Korman","year":"2010","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22, 215\u2013233 (2010)","journal-title":"Distrib. Comput."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1016\/j.tcs.2008.08.020","volume":"410","author":"N Nisse","year":"2009","unstructured":"Nisse, N., Soguet, D.: Graph searching with advice. Theor. Comput. Sci. 410, 1307\u20131318 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331\u2013347 (2012)","journal-title":"Networks"},{"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 2007), pp. 599\u2013608 2007","key":"5_CR21"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52, 1\u201324 (2005)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46018-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T18:18:22Z","timestamp":1674843502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46018-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460177","9783662460184"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46018-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 January 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}