Author:
Ferdinand Christian,Seidl Helmut,Wilhelm Reinhard
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference27 articles.
1. Aho, A.V., Ganapathi, M.: Efficient tree pattern matching: an aid to code generation. In: Proc. of the 12th ACM Symp. on Principles of Programming Languages, 1985, pp. 334?340
2. Börstler, J., Möncke, U., Wilhelm R.: Table compression for free automata. In: ACM Trans. Programm. Lang. Syst.13(3), 295?314 (1991)
3. Chase, D.R.: An improvement to bottom-up tree pattern matching. In: Proc. of 14th ACM Symposium on Principles of Programming Languages, 1987, pp. 168?177
4. Lect. Notes Comput. Sci.;M. Dauchet,1989
5. Downey, P.J., Sethi, R., Tarjan, E.R.: Variations on the common subexpression problem. In: J. ACM27, 758?771 (1980)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast and flexible instruction selection with constraints;Proceedings of the 27th International Conference on Compiler Construction;2018-02-24
2. An optimal algorithm for computing all subtree repeats in trees;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2014-05-28
3. An Optimal Algorithm for Computing All Subtree Repeats in Trees;Lecture Notes in Computer Science;2013
4. Computing all subtree repeats in ordered trees;Information Processing Letters;2012-12
5. A generic parser for strings and trees;Computer Science and Information Systems;2012