Author:
Gascón Adrià,Lohrey Markus,Maneth Sebastian,Reh Carl Philipp,Sieber Kurt
Publisher
Springer International Publishing
Reference20 articles.
1. Abiteboul, S., Bourhis, P., Vianu, V.: Highly expressive query languages for unordered data trees. Theor. Comput. Syst. 57(4), 927–966 (2015)
2. Bille, P., Gørtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inf. Comput. 243, 166–177 (2015)
3. Lecture Notes in Computer Science;A Boiret,2015
4. Bojańczyk, M., Walukiewicz, I.: Forest algebras. In: Proceedings of 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)
5. Boneva, I., Ciucanu, R., Staworko, S.: Schemas for unordered XML on a DIME. Theory Comput. Syst. 57(2), 337–376 (2015)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Balancing Straight-line Programs;Journal of the ACM;2021-06-30
2. Balancing Straight-Line Programs for Strings and Trees;Lecture Notes in Computer Science;2020
3. Navigating Forest Straight-Line Programs in Constant Time;String Processing and Information Retrieval;2020
4. Balancing Straight-Line Programs;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11
5. Grammar-Based Compression of Unranked Trees;Theory of Computing Systems;2019-08-08