{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:44Z","timestamp":1759638884787},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319144719"},{"type":"electronic","value":"9783319144726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14472-6_18","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T04:44:09Z","timestamp":1418100249000},"page":"263-276","source":"Crossref","is-referenced-by-count":3,"title":["Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt"],"prefix":"10.1007","author":[{"given":"Avery","family":"Miller","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA ), pp. 547\u2013556 (2001)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S. Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. on Control and Optimization\u00a033, 673\u2013683 (1995)","journal-title":"SIAM J. on Control and Optimization"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/nav.10011","volume":"49","author":"S. Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search on labelled networks. Naval Reaserch Logistics\u00a049, 256\u2013274 (2002)","journal-title":"Naval Reaserch Logistics"},{"key":"18_CR4","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science. Kluwer Academic Publisher (2002)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"839","DOI":"10.2307\/3214827","volume":"28","author":"E. Anderson","year":"1990","unstructured":"Anderson, E., Weber, R.: The rendezvous problem on discrete locations. Journal of Applied Probability\u00a028, 839\u2013851 (1990)","journal-title":"Journal of Applied Probability"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/opre.49.1.107.11191","volume":"49","author":"E. Anderson","year":"2001","unstructured":"Anderson, E., Fekete, S.: Two-dimensional rendezvous search. Operations Research\u00a049, 107\u2013118 (2001)","journal-title":"Operations Research"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R.A. Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Information and Computation\u00a0106, 234\u2013252 (1993)","journal-title":"Information and Computation"},{"key":"18_CR8","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.\u00a06343, pp. 297\u2013311. Springer, Heidelberg (2010)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1002\/nav.1044","volume":"48","author":"V. Baston","year":"2001","unstructured":"Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Naval Reaserch Logistics\u00a048, 722\u2013731 (2001)","journal-title":"Naval Reaserch Logistics"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-40450-4_18","volume-title":"Algorithms \u2013 ESA 2013","author":"P. Bose","year":"2013","unstructured":"Bose, P., De Carufel, J.-L., Durocher, S.: Revisiting the Problem of Searching on a Line. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 205\u2013216. Springer, Heidelberg (2013)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-87744-8_20","volume-title":"Algorithms - ESA 2008","author":"S. Caminiti","year":"2008","unstructured":"Caminiti, S., Finocchi, I., Petreschi, R.: Engineering tree labeling schemes: A case study on least common ancestor. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 234\u2013245. Springer, Heidelberg (2008)"},{"key":"18_CR12","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.\u00a041, 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms 4 (2008)","DOI":"10.1145\/1383369.1383373"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-011-0141-9","volume":"25","author":"J. Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: Log-space rendezvous in arbitrary graphs. Distributed Computing\u00a025, 165\u2013178 (2012)","journal-title":"Distributed Computing"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms 8, article 37 (2012)","DOI":"10.1145\/2344422.2344427"},{"key":"18_CR16","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\u00a046, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proc. 32nd ACM Symp. on Principles of Distributed Comp. (PODC), pp. 92\u201399 (2013)","DOI":"10.1145\/2484239.2484245"},{"key":"18_CR18","first-page":"57","volume":"31","author":"R. Ellis","year":"1976","unstructured":"Ellis, R.: Volume of an N-Simplex by Multiple Integration. Elemente der Mathematik\u00a031, 57\u201359 (1976)","journal-title":"Elemente der Mathematik"},{"key":"18_CR19","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. Theoretical Computer Science\u00a0412, 2642\u20132656 (2011)","journal-title":"Theoretical Computer Science"},{"key":"18_CR20","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. Journal of Computer and System Sciences\u00a076, 222\u2013232 (2010)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR21","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. Information and Computation\u00a0206, 1276\u20131287 (2008)","journal-title":"Information and Computation"},{"key":"18_CR22","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. Theory of Computing Systems\u00a047, 920\u2013933 (2010)","journal-title":"Theory of Computing Systems"},{"key":"18_CR23","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\u00a060, 719\u2013734 (2011)","journal-title":"Algorithmica"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-41527-2_3","volume-title":"Distributed Computing","author":"E.G. Fusco","year":"2013","unstructured":"Fusco, E.G., Pelc, A., Petreschi, R.: Use knowledge to learn faster: Topology recognition with advice. In: Afek, Y. (ed.) DISC 2013. LNCS, vol.\u00a08205, pp. 31\u201345. Springer, Heidelberg (2013)"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. Journal of Algorithms\u00a053, 85\u2013112 (2004)","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0166-218X(99)00009-8","volume":"93","author":"C.A. Hipke","year":"1999","unstructured":"Hipke, C.A., Icking, C., Klein, R., Langetepe, E.: How to find a point on a line within a fixed distance. Disc. App. Math.\u00a093, 67\u201373 (1999)","journal-title":"Disc. App. Math."},{"key":"18_CR27","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 Journal of Computing\u00a034, 23\u201340 (2004)","journal-title":"SIAM Journal of Computing"},{"key":"18_CR28","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. Distributed Computing\u00a022, 215\u2013233 (2010)","journal-title":"Distributed Computing"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11780823_5","volume-title":"Structural Information and Communication Complexity","author":"D.R. Kowalski","year":"2006","unstructured":"Kowalski, D.R., Malinowski, A.: How to meet in anonymous network. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 44\u201358. Springer, Heidelberg (2006)"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-78773-0_52","volume-title":"LATIN 2008: Theoretical Informatics","author":"E. Kranakis","year":"2008","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized Rendez-Vous with Limited Memory. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 605\u2013616. Springer, Heidelberg (2008)"},{"key":"18_CR31","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0304-3975(00)00144-4","volume":"261","author":"A. Lopez-Ortiz","year":"2001","unstructured":"Lopez-Ortiz, A., Schuierer, S.: The ultimate strategy to search on m rays? Theoretical Computer Science\u00a0261, 267\u2013295 (2001)","journal-title":"Theoretical Computer Science"},{"key":"18_CR32","unstructured":"Miller, A., Pelc, A.: Fast rendezvous with advice. In: Proc. 10th Int. Symp. on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2014) (2014), Full version at arxiv:1407.1428v1 [cs.DS]"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Miller, A., Pelc, A.: Time versus cost tradeoffs for deterministic rendezvous in networks. In: Proc. 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2014 ), pp. 282\u2013290 (2014)","DOI":"10.1145\/2611462.2611473"},{"key":"18_CR34","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. Theoretical Computer Science\u00a0410, 1307\u20131318 (2009)","journal-title":"Theoretical Computer Science"},{"key":"18_CR35","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P. Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. Journal of Algorithms\u00a033, 281\u2013295 (1999)","journal-title":"Journal of Algorithms"},{"key":"18_CR36","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\u00a059, 331\u2013347 (2012)","journal-title":"Networks"},{"key":"18_CR37","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. Journal of the ACM 55 (2008)","DOI":"10.1145\/1391289.1391291"},{"key":"18_CR38","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599\u2013608 (2007)"},{"key":"18_CR39","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\u00a052, 1\u201324 (2005)","journal-title":"J. ACM"},{"key":"18_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-540-77120-3_48","volume-title":"Algorithms and Computation","author":"Q. Xin","year":"2007","unstructured":"Xin, Q.: Faster treasure hunt and better strongly universal exploration sequences. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 549\u2013560. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14472-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T20:08:58Z","timestamp":1559074138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14472-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319144719","9783319144726"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14472-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}