{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:50:23Z","timestamp":1725529823358},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922940"},{"type":"electronic","value":"9783540922957"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92295-7_28","type":"book-chapter","created":{"date-parts":[[2009,3,25]],"date-time":"2009-03-25T08:00:00Z","timestamp":1237968000000},"page":"218-229","source":"Crossref","is-referenced-by-count":2,"title":["Compact Routing Schemes for Dynamic Trees in the Fixed Port Model"],"prefix":"10.1007","author":[{"given":"Amos","family":"Korman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/227595.227596","volume":"43","author":"Y. Afek","year":"1996","unstructured":"Afek, Y., Awerbuch, B., Plotkin, S.A., Saks, M.: Local management of a global resource in a communication network. J. ACM\u00a043, 1\u201319 (1996)","journal-title":"J. ACM"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C.: Object location using path separators. In: PODC 2006 (2006)","DOI":"10.1145\/1146381.1146411"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms\u00a04(3) (2008)","DOI":"10.1145\/1367064.1367077"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E., Ricklin, M.: Upper and lower bounds for routing schemes in dynamic networks. In: FOCS 1989, pp. 370\u2013375 (1989)","DOI":"10.1109\/SFCS.1989.63505"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: A Space Lower Bound for Routing in Trees. In: STACS 2002, pp. 65\u201375 (2002)","DOI":"10.1007\/3-540-45841-7_4"},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00446-007-0035-z","volume":"20","author":"A. Korman","year":"2007","unstructured":"Korman, A.: General compact labeling schemes for dynamic trees. J. Distributed Computing\u00a020(3), 179\u2013193 (2007)","journal-title":"J. Distributed Computing"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Korman, A.: Improved compact routing schemes for dynamic trees. In: PODC 2008 (2008)","DOI":"10.1145\/1400751.1400777"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Korman, A., Kutten, S.: Controller and estimator for dynamic networks. In: PODC 2007 (2007)","DOI":"10.1145\/1281100.1281127"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Korman, A., Peleg, D.: Compact Separator Decomposition for Dynamic Trees and Applications. J. Distributed Computing (to appear, 2008)","DOI":"10.1007\/s00446-008-0061-5"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00224-003-1106-6","volume":"37","author":"A. Korman","year":"2004","unstructured":"Korman, A., Peleg, D., Rodeh, Y.: Labeling schemes for dynamic tree networks. Theory Comput. Syst.\u00a037(1), 49\u201375 (2004)","journal-title":"Theory Comput. Syst."},{"issue":"12","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1016\/j.ic.2007.08.004","volume":"205","author":"A. Korman","year":"2007","unstructured":"Korman, A., Peleg, D.: Labeling schemes for weighted dynamic trees. J. Information and Computation\u00a0205(12), 1721\u20131740 (2007)","journal-title":"J. Information and Computation"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/11786986_54","volume-title":"Automata, Languages and Programming","author":"A. Korman","year":"2006","unstructured":"Korman, A., Peleg, D.: Dynamic routing schemes for graphs with low local density. ACM Trans. on Algorithms (to appear); Korman, A., Peleg, D.: Dynamic routing schemes for general graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 619\u2013630. Springer, Heidelberg (2006)"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labelling and implicit routing in networks. The Computer Journal\u00a028, 5\u20138 (1985)","journal-title":"The Computer Journal"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M. Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. of the ACM\u00a051, 993\u20131024 (2004)","journal-title":"J. of the ACM"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA 2001, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J. Leeuwen Van","year":"1987","unstructured":"Van Leeuwen, J., Tan, R.B.: Interval routing. The Computer Journal\u00a030, 298\u2013307 (1987)","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92295-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T06:26:36Z","timestamp":1551939996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92295-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922940","9783540922957"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92295-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}