{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:32Z","timestamp":1725750572096},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_3","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"31-45","source":"Crossref","is-referenced-by-count":4,"title":["Use Knowledge to Learn Faster: Topology Recognition with Advice"],"prefix":"10.1007","author":[{"given":"Emanuele Guido","family":"Fusco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 547\u2013556 (2001)"},{"key":"3_CR2","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":"3_CR3","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"Attiya, H., Snir, M., Warmuth, M.: Computing on an anonymous ring. Journal of the ACM\u00a035, 845\u2013875 (1988)","journal-title":"Journal of the ACM"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Koller, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. Journal of the ACM\u00a037, 524\u2013548 (1990)","journal-title":"Journal of the ACM"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In: Proc. 19th Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 230\u2013240 (1987)","DOI":"10.1145\/28395.28421"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. 18th ACM Symposium on Principles of Distributed Computing (PODC 1999), pp. 181\u2013188 (1999)","DOI":"10.1145\/301308.301355"},{"key":"3_CR7","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":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-17653-1_10","volume-title":"Principles of Distributed Systems","author":"J. Chalopin","year":"2010","unstructured":"Chalopin, J., Das, S., Kosowski, A.: Constructing a map of an anonymous graph: Applications of universal sequences. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol.\u00a06490, pp. 119\u2013134. Springer, Heidelberg (2010)"},{"key":"3_CR9","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\u00a04 (2008)","DOI":"10.1145\/1383369.1383373"},{"key":"3_CR10","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. Journal of Parallel and Distributed Computing\u00a072, 132\u2013143 (2012)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"3_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. Theoretical Computer Science\u00a0412, 2642\u20132656 (2011)","journal-title":"Theoretical Computer Science"},{"key":"3_CR12","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":"3_CR13","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":"3_CR14","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":"3_CR15","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":"3_CR16","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":"3_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00446-011-0131-y","volume":"24","author":"E. Fusco","year":"2011","unstructured":"Fusco, E., Pelc, A.: How much memory is needed for leader election. Distributed Computing\u00a024, 65\u201378 (2011)","journal-title":"Distributed Computing"},{"key":"3_CR18","doi-asserted-by":"publisher","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. Journal of Algorithms\u00a053, 85\u2013112 (2004)","journal-title":"Journal of Algorithms"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"D.S. Hirschberg","year":"1980","unstructured":"Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema-finding in circular configurations of processes. Communications of the ACM\u00a023, 627\u2013628 (1980)","journal-title":"Communications of the ACM"},{"key":"3_CR20","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0411, 1544\u20131557 (2012)","journal-title":"Theoretical Computer Science"},{"key":"3_CR21","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":"3_CR22","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":"3_CR23","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1994.1086","volume":"114","author":"E. Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., van der Berg, J.: Computing Boolean functions on anonymous networks. Information and Computation\u00a0114, 214\u2013236 (1994)","journal-title":"Information and Computation"},{"key":"3_CR24","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":"3_CR25","doi-asserted-by":"publisher","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, Philadelphia (2000)"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G.L. Peterson","year":"1982","unstructured":"Peterson, G.L.: An O(n logn) unidirectional distributed algorithm for the circular extrema problem. ACM Transactions on Programming Languages and Systems\u00a04, 758\u2013762 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR27","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. Journal of the ACM\u00a052, 1\u201324 (2005)","journal-title":"Journal of the ACM"},{"key":"3_CR28","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 Transactions on Parallel and Distributed Systems\u00a07, 69\u201389 (1996)","journal-title":"IEEE Transactions on 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-41527-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T18:35:49Z","timestamp":1558118149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}