Author:
Christou Michalis,Crochemore Maxime,Flouri Tomáš,Iliopoulos Costas S.,Janoušek Jan,Melichar Bořivoj,Pissis Solon P.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley, Reading (2006)
2. Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inf. Process. Lett. 12(5), 244–250 (1981)
3. Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpression problem. J. ACM 27, 758–771 (1980)
4. Dubiner, M., Galil, Z., Magen, E.: Faster tree pattern matching. J. ACM 41, 205–213 (1994)
5. Flajolet, P., Sipala, P., Steyaert, J.M.: Analytic variations on the common subexpression problem. In: Proceedings of the Seventeenth International Colloquium on Automata, Languages and Programming, pp. 220–234. Springer-Verlag New York, Inc., New York (1990)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献