{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:32Z","timestamp":1760202752520},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319720494"},{"type":"electronic","value":"9783319720500"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72050-0_3","type":"book-chapter","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T11:57:13Z","timestamp":1514548633000},"page":"37-52","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Short Labeling Schemes for Topology Recognition in Wireless Tree Networks"],"prefix":"10.1007","author":[{"given":"Barun","family":"Gorain","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":[[2017,12,30]]},"reference":[{"key":"3_CR1","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 547\u2013556 (2001)"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0196-6774(02)00004-4","volume":"43","author":"M Chrobak","year":"2002","unstructured":"Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. J. Algorithms 43, 177\u2013189 (2002)","journal-title":"J. Algorithms"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"42","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, 42 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"3_CR4","doi-asserted-by":"crossref","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":"3_CR5","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 412, 2642\u20132656 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR6","doi-asserted-by":"crossref","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. Distrib. Comput. 21, 395\u2013403 (2009)","journal-title":"Distrib. Comput."},{"key":"3_CR7","doi-asserted-by":"crossref","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":"3_CR8","doi-asserted-by":"crossref","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":"3_CR9","doi-asserted-by":"crossref","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 Comput. Syst. 47, 920\u2013933 (2010)","journal-title":"Theory Comput. Syst."},{"key":"3_CR10","doi-asserted-by":"crossref","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":"3_CR11","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.ic.2016.01.005","volume":"247","author":"E Fusco","year":"2016","unstructured":"Fusco, E., Pelc, A., Petreschi, R.: Topology recognition with advice. Inf. Comput. 247, 254\u2013265 (2016)","journal-title":"Inf. Comput."},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00453-006-1212-3","volume":"47","author":"L Gasieniec","year":"2007","unstructured":"Gasieniec, L., Pagourtzis, A., Potapov, I., Radzik, T.: Deterministic communication in radio networks with large labels. Algorithmica 47, 97\u2013117 (2007)","journal-title":"Algorithmica"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s00446-006-0011-z","volume":"19","author":"L Gasieniec","year":"2007","unstructured":"Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. Distrib. Comput. 19, 289\u2013300 (2007)","journal-title":"Distrib. Comput."},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53, 85\u2013112 (2004)","journal-title":"J. Algorithms"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Glacet, C., Miller, A., Pelc, A.: Time vs. information tradeoffs for leader election in anonymous trees. In: Proceedings of 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 600\u2013609 (2016)","DOI":"10.1137\/1.9781611974331.ch44"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"1544","DOI":"10.1016\/j.tcs.2010.01.004","volume":"411","author":"D Ilcinkas","year":"2012","unstructured":"Ilcinkas, D., Kowalski, D., Pelc, A.: Fast radio broadcasting with advice. Theoret. Comput. Sci. 411, 1544\u20131557 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR17","doi-asserted-by":"crossref","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":"3_CR18","doi-asserted-by":"crossref","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":"3_CR19","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1016\/j.jcss.2013.04.003","volume":"79","author":"D Kowalski","year":"2013","unstructured":"Kowalski, D., Pelc, A.: Leader election in ad hoc radio networks: a keen ear helps. J. Comput. Syst. Sci. 79, 1164\u20131180 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR20","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 410, 1307\u20131318 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR21","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing, a Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing, a Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2000)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72050-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T11:58:02Z","timestamp":1514548682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72050-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319720494","9783319720500"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72050-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}