Author:
Gascón Adrià,Lohrey Markus,Maneth Sebastian,Reh Carl Philipp,Sieber Kurt
Funder
Deutsche Forschungsgemeinschaft
Engineering and Physical Sciences Research Council
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference30 articles.
1. Abiteboul, S., Bourhis, P., Vianu, V.: Highly expressive query languages for unordered data trees. Theory Comput. Syst. 57(4), 927–966 (2015)
2. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)
3. Bille, P., Gørtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inf. Comput. 243, 166–177 (2015)
4. Boiret, A., Hugot, V., Niehren, J., Treinen, R.: Logics for unordered trees with data constraints on siblings. In: Proceedings of LATA 2015, Volume 8977 of Lecture Notes in Computer Science, pp 175–187. Springer (2015)
5. Bojańczyk, M., Walukiewicz, I.: Forest algebras. In: Proceedings of Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas], Volume 2 of Texts in Logic and Games, pp 107–132. Amsterdam University Press (2008)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献