{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:11:30Z","timestamp":1725563490145},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_30","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T05:48:44Z","timestamp":1282628924000},"page":"328-342","source":"Crossref","is-referenced-by-count":2,"title":["Drawing Maps with Advice"],"prefix":"10.1007","author":[{"given":"Dariusz","family":"Dereniowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ), pp. 547\u2013556 (2001)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S. Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM Journal on Computing\u00a029, 1164\u20131188 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Annual ACM Symposium on Theory of Computing (STOC 1980), pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: Exploring and mapping directed graphs. Information and Computation\u00a0176, 1\u201321 (2002)","journal-title":"Information and Computation"},{"key":"30_CR5","first-page":"231","volume":"18","author":"M. Betke","year":"1995","unstructured":"Betke, M., Rivest, R., Singh, M.: Piecemeal learning of an unknown environment. Machine Learning\u00a018, 231\u2013254 (1995)","journal-title":"Machine Learning"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-45414-4_3","volume-title":"Distributed Computing","author":"P. Boldi","year":"2001","unstructured":"Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 33\u201347. Springer, Heidelberg (2001)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11523468_28","volume-title":"Automata, Languages and Programming","author":"R. Cohen","year":"2005","unstructured":"Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 335\u2013346. Springer, Heidelberg (2005)"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X. Deng","year":"1999","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. Journal of Graph Theory\u00a032, 265\u2013297 (1999)","journal-title":"Journal of Graph Theory"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.tcs.2004.07.031","volume":"326","author":"A. Dessmark","year":"2004","unstructured":"Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. Theoretical Computer Science\u00a0326, 343\u2013362 (2004)","journal-title":"Theoretical Computer Science"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","volume":"51","author":"K. Diks","year":"2004","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. Journal of Algorithms\u00a051, 38\u201363 (2004)","journal-title":"Journal of Algorithms"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00446-008-0076-y","volume":"21","author":"P. Fraigniaud","year":"2009","unstructured":"Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing\u00a021, 395\u2013403 (2009)","journal-title":"Distributed Computing"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle size: a new measure of difficulty for communication problems. In: Proc. 25th Ann. ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 179\u2013187 (2006)","DOI":"10.1145\/1146381.1146410"},{"key":"30_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 an oracle. Information and Computation\u00a0206, 1276\u20131287 (2008)","journal-title":"Information and Computation"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. In: Proc. 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2007), pp. 154\u2013160 (2007)","DOI":"10.1145\/1248377.1248402"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-540-87779-0_17","volume-title":"Distributed Computing","author":"P. Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 242\u2013256. Springer, Heidelberg (2008)"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Fusco, E., Pelc, A.: Trade-offs between the size of advice and broadcasting time in trees. In: Proc. 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2008), pp. 77\u201384 (2008)","DOI":"10.1145\/1378533.1378545"},{"key":"30_CR17","unstructured":"Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 585\u2013594 (2007)"},{"key":"30_CR18","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 210\u2013219 (2001)"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-69355-0_24","volume-title":"Structural Information and Communication Complexity","author":"D. Ilcinkas","year":"2008","unstructured":"Ilcinkas, D., Kowalski, D., Pelc, A.: Fast radio broadcasting with advice. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol.\u00a05058, pp. 291\u2013305. Springer, Heidelberg (2008)"},{"key":"30_CR20","unstructured":"Katz, M., Katz, N., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 927\u2013936 (2002)"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC 2005), pp. 9\u201318 (2005)","DOI":"10.1145\/1073814.1073817"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0166-218X(93)E0133-J","volume":"56","author":"N. Norris","year":"1995","unstructured":"Norris, N.: Universal covers of graphs: Isomorphism to depth N-1 implies isomorphism to all depths. Discrete Applied Mathematics\u00a056, 61\u201374 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR23","series-title":"Lecture Notes in Computer Science","first-page":"51","volume-title":"Structural Information and Communication Complexity","author":"D. Soguet","year":"2007","unstructured":"Soguet, D., Nisse, N.: Graph searching with advice. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol.\u00a04474, pp. 51\u201365. Springer, Heidelberg (2007)"},{"issue":"1","key":"30_CR24","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), 1\u201324 (2005)","journal-title":"J. ACM"},{"key":"30_CR25","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Trans. Parallel and Distributed Systems\u00a07, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:39:46Z","timestamp":1606167586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}