{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:09Z","timestamp":1760202729784,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T00:00:00Z","timestamp":1486339200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["LO 748\/10-1"],"award-info":[{"award-number":["LO 748\/10-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s00453-017-0279-3","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T10:11:35Z","timestamp":1486375895000},"page":"885-917","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Tree Compression Using String Grammars"],"prefix":"10.1007","volume":"80","author":[{"given":"Moses","family":"Ganardi","sequence":"first","affiliation":[]},{"given":"Danny","family":"Hucke","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Noeth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"issue":"18\u201319","key":"279_CR1","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1016\/j.ipl.2010.07.004","volume":"110","author":"T Akutsu","year":"2010","unstructured":"Akutsu, T.: A bisection algorithm for grammar-based compression of ordered trees. Inf. Process. Lett. 110(18\u201319), 815\u2013820 (2010)","journal-title":"Inf. Process. Lett."},{"key":"279_CR2","doi-asserted-by":"crossref","unstructured":"Allender, E., Balaji, N., Datta, S.: Low-depth uniform threshold circuits and the bit-complexity of straight line programs. In: Proceedings of MFCS 2014, Part II, volume 8635 of Lecture Notes in Computer Science, pp. 13\u201324. Springer (2014)","DOI":"10.1007\/978-3-662-44465-8_2"},{"issue":"5","key":"279_CR3","doi-asserted-by":"crossref","first-page":"1987","DOI":"10.1137\/070697926","volume":"38","author":"E Allender","year":"2009","unstructured":"Allender, E., B\u00fcrgisser, P., Kjeldgaard-Pedersen, J., Bro Miltersen, P.: On the complexity of numerical analysis. SIAM J. Comput. 38(5), 1987\u20132006 (2009)","journal-title":"SIAM J. Comput."},{"key":"279_CR4","first-page":"182","volume":"40","author":"E Allender","year":"1990","unstructured":"Allender, E., Wagner, K.W.: Counting hierarchies: polynomial time and constant depth circuits. Bull. EATCS 40, 182\u2013194 (1990)","journal-title":"Bull. EATCS"},{"key":"279_CR5","doi-asserted-by":"crossref","unstructured":"Bertoni, A., Choffrut, C., Radicioni, R.: Literal shuffle of compressed words. In: Proceedings of IFIP TCS 2008, volume 273 of IFIP, pp. 87\u2013100. Springer (2008)","DOI":"10.1007\/978-0-387-09680-3_6"},{"issue":"4","key":"279_CR6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","volume":"43","author":"D Benoit","year":"2005","unstructured":"Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275\u2013292 (2005)","journal-title":"Algorithmica"},{"key":"279_CR7","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.ic.2014.12.012","volume":"243","author":"P Bille","year":"2015","unstructured":"Bille, P., G\u00f8rtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inf. Comput. 243, 166\u2013177 (2015)","journal-title":"Inf. Comput."},{"issue":"3","key":"279_CR8","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/130936889","volume":"44","author":"P Bille","year":"2015","unstructured":"Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513\u2013539 (2015)","journal-title":"SIAM J. Comput."},{"key":"279_CR9","doi-asserted-by":"crossref","first-page":"1322","DOI":"10.1007\/s00224-014-9544-x","volume":"57","author":"M Bousquet-M\u00e9lou","year":"2014","unstructured":"Bousquet-M\u00e9lou, M., Lohrey, M., Maneth, S., Noeth, E.: XML compression via DAGs. Theory Comput. Syst. 57, 1322 (2014)","journal-title":"Theory Comput. Syst."},{"issue":"4\u20135","key":"279_CR10","doi-asserted-by":"crossref","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. Inf. Syst. 33(4\u20135), 456\u2013474 (2008)","journal-title":"Inf. Syst."},{"key":"279_CR11","doi-asserted-by":"crossref","unstructured":"Buss, S.R.: The Boolean formula value problem is in ALOGTIME. In: Proceedings of STOC 1987, pp. 123\u2013131. ACM Press (1987)","DOI":"10.1145\/28395.28409"},{"issue":"2","key":"279_CR12","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1006\/jcss.1998.1588","volume":"57","author":"H Caussinus","year":"1998","unstructured":"Caussinus, H., McKenzie, P., Th\u00e9rien, D., Vollmer, H.: Nondeterministic $$NC^1$$ N C 1 computation. J. Comput. Syst. Sci. 57(2), 200\u2013212 (1998)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"279_CR13","doi-asserted-by":"crossref","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. Inf. Theory 51(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"279_CR14","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., L\u00f6ding, Tison, S., Tommasi, M.: Tree automata techniques and applications. http:\/\/tata.gforge.inria.fr\/"},{"key":"279_CR15","doi-asserted-by":"crossref","unstructured":"Esparza, J., Luttenberger, M., Schlund, M.: A brief history of strahler numbers. In: Proceedings of LATA 2014, volume 8370 of Lecture Notes in Computer Science, pp. 1\u201313. Springer (2014)","DOI":"10.1007\/978-3-319-04921-2_1"},{"issue":"1","key":"279_CR16","doi-asserted-by":"crossref","first-page":"4","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 57(1), 4 (2009)","journal-title":"J. ACM"},{"key":"279_CR17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(79)90009-4","volume":"9","author":"P Flajolet","year":"1979","unstructured":"Flajolet, P., Raoult, J.-C., Vuillemin, J.: The number of registers required for evaluating arithmetic expressions. Theor. Comput. Sci. 9, 99\u2013125 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"279_CR18","doi-asserted-by":"publisher","unstructured":"Ganardi, M., Hucke, D., Je\u017c, A., Lohrey, M., Noeth, E.: Constructing small tree grammars and small circuits for formulas. J. Comput. Syst. Sci. (2017). doi: 10.1016\/j.jcss.2016.12.007","DOI":"10.1016\/j.jcss.2016.12.007"},{"key":"279_CR19","doi-asserted-by":"crossref","unstructured":"Ganardi, M., Hucke, D., Lohrey, M., Noeth, E.: Tree compression using string grammars. In: Proceedings of LATIN 2016, volume 9644 of Lecture Notes in Computer Science, pp. 590\u2013604. Springer (2016)","DOI":"10.1007\/978-3-662-49529-2_44"},{"key":"279_CR20","unstructured":"Hagenah, C.: Gleichungen mit regul\u00e4ren Randbedingungen \u00fcber freien Gruppen. PhD thesis, University of Stuttgart, Institut f\u00fcr Informatik (2000)"},{"key":"279_CR21","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Mix Barrington, D.A.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci. 65, 695\u2013716 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"279_CR22","doi-asserted-by":"crossref","unstructured":"H\u00fcbschle-Schneider, L., Raman, R.: Tree compression with top trees revisited. In: Proceedings of SEA 2015, volume 9125 of Lecture Notes in Computer Science, pp. 15\u201327. Springer (2015)","DOI":"10.1007\/978-3-319-20086-6_2"},{"key":"279_CR23","unstructured":"Hucke, D., Lohrey, M., Noeth, E.: Constructing small tree grammars and small circuits for formulas. In: Proceedings of FSTTCS 2014, volume 29 of LIPIcs, pp. 457\u2013468. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, (2014)"},{"key":"279_CR24","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of FOCS 1989, pp. 549\u2013554. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"issue":"2","key":"279_CR25","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.jcss.2011.09.002","volume":"78","author":"J Jansson","year":"2012","unstructured":"Jansson, J., Sadakane, K., Sung, W.-K.: Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. 78(2), 619\u2013631 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"279_CR26","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.tcs.2015.05.027","volume":"592","author":"A Je\u017c","year":"2015","unstructured":"Je\u017c, A.: Approximation of grammar-based compression via recompression. Theor. Comput. Sci. 592, 115\u2013134 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"279_CR27","first-page":"20:1","volume":"11","author":"A Je\u017c","year":"2015","unstructured":"Je\u017c, A.: Faster fully compressed pattern matching by recompression. ACM Trans. Algorithms 11(3), 20:1\u201320:43 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"279_CR28","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.tcs.2015.12.032","volume":"616","author":"A Je\u017c","year":"2016","unstructured":"Je\u017c, A.: A really simple approximation of smallest grammar. Theor. Comput. Sci. 616, 141\u2013150 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"279_CR29","unstructured":"Je\u017c, A., Lohrey, M.: Approximation of smallest linear tree grammars. In Procedings of STACS 2014, volume 25 of LIPIcs, pp. 445\u2013457. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2014)"},{"key":"279_CR30","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Matsuda, K., Shinohara, A.: Functional programs as compressed data. In: Proceedings of PEPM 2012, pp. 121\u2013130. ACM Press (2012)","DOI":"10.1145\/2103746.2103770"},{"key":"279_CR31","doi-asserted-by":"crossref","unstructured":"Lohrey, M.: On the parallel complexity of tree automata. In: Proceedings of RTA 2001, volume 2051 of Lecture Notes in Computer Science, pp. 201\u2013215. Springer (2001)","DOI":"10.1007\/3-540-45127-7_16"},{"issue":"6","key":"279_CR32","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1016\/j.ic.2011.01.009","volume":"209","author":"M Lohrey","year":"2011","unstructured":"Lohrey, M.: Leaf languages and string compression. Inf. Comput. 209(6), 951\u2013965 (2011)","journal-title":"Inf. Comput."},{"key":"279_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4939-0748-9","volume-title":"The Compressed Word Problem for Groups","author":"M Lohrey","year":"2014","unstructured":"Lohrey, M.: The Compressed Word Problem for Groups. Springer, Berlin (2014)"},{"key":"279_CR34","doi-asserted-by":"crossref","unstructured":"Lohrey, M.: Grammar-based tree compression. In: Proceedings of DLT 2015, volume 9168 of Lecture Notes in Computer Science, pp. 46\u201357. Springer (2015)","DOI":"10.1007\/978-3-319-21500-6_3"},{"issue":"2","key":"279_CR35","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tcs.2006.07.024","volume":"363","author":"M Lohrey","year":"2006","unstructured":"Lohrey, M., Maneth, S.: The complexity of tree automata and XPath on grammar-compressed trees. Theor. Comput. Sci. 363(2), 196\u2013210 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"279_CR36","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.is.2013.06.006","volume":"38","author":"M Lohrey","year":"2013","unstructured":"Lohrey, M., Maneth, S., Mennicke, R.: XML tree structure compression using RePair. Inf. Syst. 38(8), 1150\u20131167 (2013)","journal-title":"Inf. Syst."},{"issue":"5","key":"279_CR37","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1016\/j.jcss.2012.03.003","volume":"78","author":"M Lohrey","year":"2012","unstructured":"Lohrey, M., Maneth, S., Schmidt-Schau\u00df, M.: Parameter reduction and automata evaluation for grammar-compressed trees. J. Comput. Syst. Sci. 78(5), 1651\u20131669 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"279_CR38","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ic.2013.01.002","volume":"224","author":"M Lohrey","year":"2013","unstructured":"Lohrey, M., Mathissen, C.: Isomorphism of regular trees and words. Inf. Comput. 224, 71\u2013105 (2013)","journal-title":"Inf. Comput."},{"issue":"3","key":"279_CR39","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"JI Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comput."},{"key":"279_CR40","doi-asserted-by":"crossref","unstructured":"Navarro, G., Ord\u00f3 nez Pereira, A.: Faster compressed suffix trees for repetitive text collections. In: Proceedings of SEA 2014, volume 8504 of Lecture Notes in Computer Science, pp. 424\u2013435. Springer (2014)","DOI":"10.1007\/978-3-319-07959-2_36"},{"issue":"1\u20133","key":"279_CR41","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1\u20133), 211\u2013222 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20134","key":"279_CR42","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/j.jda.2004.08.016","volume":"3","author":"H Sakamoto","year":"2005","unstructured":"Sakamoto, H.: A fully linear-time approximation algorithm for grammar-based compression. J. Discrete Algorithms 3(2\u20134), 416\u2013430 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"279_CR43","doi-asserted-by":"crossref","unstructured":"Schmidt-Schau\u00df, M.: Linear compressed pattern matching for polynomial rewriting (extended abstract). In: Proceedings of TERMGRAPH 2013, volume 110 of EPTCS, pp. 29\u201340 (2013)","DOI":"10.4204\/EPTCS.110.5"},{"issue":"5","key":"279_CR44","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20(5), 865\u2013877 (1991)","journal-title":"SIAM J. Comput."},{"key":"279_CR45","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity. Springer, Berlin (1999)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0279-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0279-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0279-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:32:05Z","timestamp":1568784725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0279-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,6]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["279"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0279-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,2,6]]}}}