Author:
Reh Carl Philipp,Sieber Kurt
Publisher
Springer International Publishing
Reference15 articles.
1. Bille, P., Gørtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inf. Comput. 243, 166–177 (2015).
https://doi.org/10.1016/j.ic.2014.12.012
2. 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–539 (2015).
https://doi.org/10.1137/130936889
3. Bojanczyk, M., Walukiewicz, I.: Forest algebras. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games, vol. 2, pp. 107–132. Amsterdam University Press (2008)
4. Lecture Notes in Computer Science;I Boneva,2019
5. Cai, J., Paige, R.: Using multiset discrimination to solve language processing problems without hashing. Theor. Comput. Sci. 145(1&2), 189–228 (1995).
https://doi.org/10.1016/0304-3975(94)00183-J