{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:55Z","timestamp":1725541855665},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_6","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T08:12:27Z","timestamp":1259827947000},"page":"66-76","source":"Crossref","is-referenced-by-count":0,"title":["Low-Port Tree Representations"],"prefix":"10.1007","author":[{"given":"Shiri","family":"Chechik","sequence":"first","affiliation":[]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: Proc. 16th ACM Symp. on Parallel Algorithms & Architectures (SPAA), pp. 20\u201324 (2004)","DOI":"10.1145\/1007912.1007916"},{"key":"6_CR2","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, New York (1998)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive network routing. In: Proc. 21st ACM Symp. on Theory of Computing, pp. 230\u2013240 (1989)","DOI":"10.1145\/73007.73053"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/0405013","volume":"5","author":"B. Awerbuch","year":"1992","unstructured":"Awerbuch, B., Peleg, D.: Routing with polynomial communication-space trade-off. SIAM J. on Discrete Math.\u00a05, 151\u2013162 (1992)","journal-title":"SIAM J. on Discrete Math."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11603771_2","volume-title":"Distributed Computing \u2013 IWDC 2005","author":"R. Cohen","year":"2005","unstructured":"Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Labeling Schemes for Tree Representation. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds.) IWDC 2005. LNCS, vol.\u00a03741, pp. 13\u201324. Springer, Heidelberg (2005)"},{"key":"6_CR7","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":"6_CR8","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. In: Proc. 12th ACM Symp. on Discrete Algorithms, pp. 210\u2013219 (2001)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S. Kannan","year":"1992","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit Representation of Graphs. SIAM J. on Descrete Math.\u00a05, 596\u2013603 (1992)","journal-title":"SIAM J. on Descrete Math."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/S0097539703433912","volume":"34","author":"M. Katz","year":"2004","unstructured":"Katz, M., Katz, N.A., Korman, A., Peleg, D.: Labeling Schemes for Flow and Connectivity. SIAM J. Computing\u00a034, 23\u201340 (2004)","journal-title":"SIAM J. Computing"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof Labeling Schemes. In: Proc. 24th ACM Symp. on Principles of Distributed Computing, PODC (2005)","DOI":"10.1145\/1073814.1073817"},{"key":"6_CR12","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 of Computing Systems (Special Issue of STACS 2002)\u00a037, 49\u201375 (2004)","journal-title":"Theory of Computing Systems (Special Issue of STACS 2002)"},{"key":"6_CR13","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1995","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1995)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-46784-X_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Peleg","year":"1999","unstructured":"Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 30\u201341. Springer, Heidelberg (1999)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/3-540-44612-5_53","volume-title":"Mathematical Foundations of Computer Science 2000","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Informative labeling schemes for graphs. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 579\u2013588. Springer, Heidelberg (2000)"},{"key":"6_CR16","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, Philadelphia (2000)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A tradeoff between size and efficiency for routing tables. J. ACM\u00a036, 510\u2013530 (1989)","journal-title":"J. ACM"},{"key":"6_CR18","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":"6_CR19","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. 13th ACM Symp. on Parallel Algorithms & Architectures (SPAA), pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-3-642-95486-3_22","volume-title":"The Book of L","author":"J. Leeuwen van","year":"1986","unstructured":"van Leeuwen, J., Tan, R.B.: Routing with compact routing tables. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, pp. 259\u2013273. Springer, Heidelberg (1986)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:40:21Z","timestamp":1606167621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}