{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:29:46Z","timestamp":1742945386898,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_27","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"337-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Compressed Tree Canonization"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Maneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Peternek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"27_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/BF03180566","volume":"4","author":"J Balc\u00e1zar","year":"1992","unstructured":"Balc\u00e1zar, J., Gabarr\u00f3, J., S\u00e1ntha, M.: Deciding bisimilarity is P-complete. Formal Aspects of Computing 4, 638\u2013648 (1992)","journal-title":"Formal Aspects of Computing"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-32940-1_12","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"R Brenguier","year":"2012","unstructured":"Brenguier, R., G\u00f6ller, S., Sankur, O.: A comparison of succinctly represented finite-state systems. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 147\u2013161. Springer, Heidelberg (2012)"},{"issue":"4\u20135","key":"27_CR4","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. Inf. Syst. 33(4\u20135), 456\u2013474 (2008)","journal-title":"Inf. Syst."},{"key":"27_CR5","first-page":"18","volume":"97","author":"SR Buss","year":"1997","unstructured":"Buss, S.R.: Alogtime algorithms for tree isomorphism, comparison, and canonization. Kurt G\u00f6del Colloquium 97, 18\u201333 (1997)","journal-title":"Kurt G\u00f6del Colloquium"},{"issue":"7","key":"27_CR6","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. Inf. Theory 51(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-04921-2_23","volume-title":"Language and Automata Theory and Applications","author":"B Das","year":"2014","unstructured":"Das, B., Scharpfenecker, P., Tor\u00e1n, J.: Succinct encodings of graph isomorphism. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 285\u2013296. Springer, Heidelberg (2014)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","volume":"56","author":"H Galperin","year":"1983","unstructured":"Galperin, H., Wigderson, A.: Succinct representations of graphs. Inf. Contr. 56, 183\u2013198 (1983)","journal-title":"Inf. Contr."},{"issue":"3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/S0022-0000(03)00042-4","volume":"66","author":"B Jenner","year":"2003","unstructured":"Jenner, B., K\u00f6bler, J., McKenzie, P., Tor\u00e1n, J.: Completeness results for graph isomorphism. J. Comput. Syst. Sci. 66(3), 549\u2013566 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(92)90004-3","volume":"44","author":"T Lengauer","year":"1992","unstructured":"Lengauer, T., Wagner, K.W.: The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems. J. Comput. Syst. Sci. 44, 63\u201393 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Lindell, S.: A logspace algorithm for tree canonization (extended abstract). In: Proc. STOC 1992, pp. 400\u2013404. ACM (1992)","DOI":"10.1145\/129712.129750"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1515\/gcc-2012-0016","volume":"4","author":"M Lohrey","year":"2012","unstructured":"Lohrey, M.: Algorithmics on SLP-compressed strings: a survey. Groups Complexity Cryptology 4(2), 241\u2013299 (2012)","journal-title":"Groups Complexity Cryptology"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Lohrey, M., Maneth, S., Peternek, F.: Compressed tree canonization (2015). arXiv.org http:\/\/arxiv.org\/abs\/1502.04625","DOI":"10.1007\/978-3-662-47666-6_27"},{"issue":"5","key":"27_CR14","doi-asserted-by":"publisher","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":"27_CR15","doi-asserted-by":"publisher","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."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:26:27Z","timestamp":1674566787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}