{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:56:21Z","timestamp":1725530181310},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005954"},{"type":"electronic","value":"9783642005961"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00596-1_16","type":"book-chapter","created":{"date-parts":[[2009,3,27]],"date-time":"2009-03-27T01:13:03Z","timestamp":1238116383000},"page":"212-226","source":"Crossref","is-referenced-by-count":4,"title":["Parameter Reduction in Grammar-Compressed Trees"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Maneth","sequence":"additional","affiliation":[]},{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-55210-3_181","volume-title":"STACS 92","author":"B. Bogaert","year":"1992","unstructured":"Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 161\u2013171. Springer, Heidelberg (1992)"},{"key":"16_CR2","first-page":"141","volume-title":"VLDB 2003","author":"P. Buneman","year":"2003","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: VLDB 2003, pp. 141\u2013152. Morgan Kaufmann, San Francisco (2003)"},{"issue":"4\u20135","key":"16_CR3","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\u20135), 456\u2013474 (2008)","journal-title":"Information Systems"},{"key":"16_CR4","unstructured":"Comon-Lundh, H., Dauchet, M., Gilleron, R., Jacquemard, F., L\u00f6ding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-71389-0_13","volume-title":"Foundations of Software Science and Computational Structures","author":"H. Comon-Lundh","year":"2007","unstructured":"Comon-Lundh, H., Jacquemard, F., Perrin, N.: Tree automata with memory, visibility and structural constraints. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 168\u2013182. Springer, Heidelberg (2007)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","volume":"20","author":"J. Engelfriet","year":"1980","unstructured":"Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree transducers, L systems, and two-way machines. J. Comp. Syst. Sci.\u00a020, 150\u2013202 (1980)","journal-title":"J. Comp. Syst. Sci."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Fischer, M.: Grammars with macro-like productions. PhD thesis, Harvard University, Massachusetts (May 1968)","DOI":"10.1109\/SWAT.1968.12"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s002249910004","volume":"33","author":"A. Fujiyoshi","year":"2000","unstructured":"Fujiyoshi, A., Kasai, T.: Spinal-formed context-free tree grammars. Theory Comput. Syst.\u00a033(1), 59\u201383 (2000)","journal-title":"Theory Comput. Syst."},{"key":"16_CR9","first-page":"93","volume-title":"LICS 2008","author":"A. Gasc\u00f3n","year":"2008","unstructured":"Gasc\u00f3n, A., Godoy, G., Schmidt-Schau\u00df, M.: Context matching for compressed terms. In: LICS 2008, pp. 93\u2013102. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/11805618_30","volume-title":"Term Rewriting and Applications","author":"J. Levy","year":"2006","unstructured":"Levy, J., Schmidt-Schau\u00df, M., Villaret, M.: Bounded second-order unification is NP-complete. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 400\u2013414. Springer, Heidelberg (2006)"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","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.\u00a0363(2), 196\u2013210 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms - ESA \u201994","author":"W. Plandowski","year":"1994","unstructured":"Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 460\u2013470. Springer, Heidelberg (1994)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-27836-8_5","volume-title":"Automata, Languages and Programming","author":"W. Rytter","year":"2004","unstructured":"Rytter, W.: Grammar compression, LZ-encodings, and string algorithms with implicit input. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 15\u201327. Springer, Heidelberg (2004)"},{"key":"16_CR14","unstructured":"Schmidt-Schau\u00df, M.: Polynomial equality testing for terms with shared substructures. Technical Report 21, Institut f\u00fcr Informatik, J. W. Goethe-Universit\u00e4t Frankfurt am Main (2005)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00596-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T03:52:04Z","timestamp":1558237924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00596-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005954","9783642005961"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00596-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}