{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:54:44Z","timestamp":1725738884036},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392054"},{"type":"electronic","value":"9783642392061"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39206-1_14","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T17:20:16Z","timestamp":1372785616000},"page":"160-171","source":"Crossref","is-referenced-by-count":5,"title":["Tree Compression with Top Trees"],"prefix":"10.1007","author":[{"given":"Philip","family":"Bille","sequence":"first","affiliation":[]},{"given":"Inge Li","family":"G\u00f8rtz","sequence":"additional","affiliation":[]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[]},{"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1002\/asi.20496","volume":"58","author":"J. Adiego","year":"2007","unstructured":"Adiego, J., Navarro, G., de la Fuente, P.: Lempel-Ziv compression of highly structured documents. J. Amer. Soc. Inf. Sci. and Techn.\u00a058(4), 461\u2013478 (2007)","journal-title":"J. Amer. Soc. Inf. Sci. and Techn."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-63165-8_184","volume-title":"Automata, Languages and Programming","author":"S. Alstrup","year":"1997","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Minimizing diameters of dynamic trees. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 270\u2013280. Springer, Heidelberg (1997)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/1103963.1103966","volume":"1","author":"S. Alstrup","year":"2003","unstructured":"Alstrup, S., Holm, J., Lichtenberg, K.D., Thorup, M.: Maintaining information in fully-dynamic trees with top trees. ACM Trans. Algorithms\u00a01, 243\u2013264 (2003)","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-44985-X_6","volume-title":"Algorithm Theory - SWAT 2000","author":"S. Alstrup","year":"2000","unstructured":"Alstrup, S., Holm, J., Thorup, M.: Maintaining center and median in dynamic trees. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 46\u201356. Springer, Heidelberg (2000)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","volume":"43","author":"D. Benoit","year":"2005","unstructured":"Benoit, D., Demaine, E., Munro, I., Raman, R., Raman, V., Rao, S.: Representing trees of higher degree. Algorithmica\u00a043, 275\u2013292 (2005)","journal-title":"Algorithmica"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Bille, P., G\u00f8rtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Arxiv preprint arXiv:1304.5702 (2013)","DOI":"10.1007\/978-3-642-39206-1_14"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bille, P., Landau, G., Raman, R., Rao, S., Sadakane, K., Weimann, O.: Random access to grammar-compressed strings. In: Proc. 22nd SODA, pp. 373\u2013389 (2011)","DOI":"10.1137\/1.9781611973082.30"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: Proc. 29th VLDB, pp. 141\u2013152 (2003)","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"key":"14_CR9","unstructured":"Busatto, G., Lohrey, M., Maneth, S.: Grammar-based tree compression. Technical report, EPFL (2004)"},{"issue":"4-5","key":"14_CR10","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.is.2008.01.004","volume":"33","author":"G. Busatto","year":"2008","unstructured":"Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML document trees. Information Systems\u00a033(4-5), 456\u2013474 (2008)","journal-title":"Information Systems"},{"issue":"7","key":"14_CR11","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Lehman, E., Lehman, A., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inform. Theory\u00a051(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"P.J. Downey","year":"1980","unstructured":"Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpression problem. J. ACM\u00a027, 758\u2013771 (1980)","journal-title":"J. ACM"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1613676.1613680","volume":"57","author":"P. Ferragina","year":"2009","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM\u00a057, 1\u201333 (2009)","journal-title":"J. ACM"},{"key":"14_CR14","unstructured":"Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees. In: Proc. 18th LICS, pp. 188\u2013197 (2003)"},{"key":"14_CR15","unstructured":"Geary, R., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. In: Proc. 15th SODA, pp. 1\u201310 (2004)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Lohrey, M., Maneth, S.: The complexity of tree automata and XPath on grammar-compressed trees. Theoret. Comput. Sci.\u00a0363(2) (2006)","DOI":"10.1016\/j.tcs.2006.07.024"},{"key":"14_CR18","first-page":"1007","volume":"arXiv","author":"M. Lohrey","year":"2010","unstructured":"Lohrey, M., Maneth, S., Mennicke, R.: Tree structure compression with repair. Arxiv preprint arXiv:1007.5406 (2010)","journal-title":"Arxiv preprint"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-24727-2_26","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Maneth","year":"2004","unstructured":"Maneth, S., Busatto, G.: Tree transducers and tree compressions. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 363\u2013377. Springer, Heidelberg (2004)"},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput.\u00a031(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39206-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:42:16Z","timestamp":1557913336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39206-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392054","9783642392061"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39206-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}