Author:
Lohrey Markus,Maneth Sebastian,Peternek Fabian
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Aho, A., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Balcázar, J., Gabarró, J., Sántha, M.: Deciding bisimilarity is P-complete. Formal Aspects of Computing 4, 638–648 (1992)
3. Lecture Notes in Computer Science;R Brenguier,2012
4. Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML document trees. Inf. Syst. 33(4–5), 456–474 (2008)
5. Buss, S.R.: Alogtime algorithms for tree isomorphism, comparison, and canonization. Kurt Gödel Colloquium 97, 18–33 (1997)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Grammar-Based Compression of Unranked Trees;Theory of Computing Systems;2019-08-08
2. Grammar-Based Compression;Encyclopedia of Big Data Technologies;2019
3. Grammar-based graph compression;Information Systems;2018-07
4. Grammar-Based Compression of Unranked Trees;Computer Science – Theory and Applications;2018
5. Grammar-Based Compression;Encyclopedia of Big Data Technologies;2018