Author:
Gupta Arvind,Nishimura Naomi
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. R. Brent, The parallel evaluation of general arithmetic expressions, Journal of the ACM 21, 2 (1974), pp. 201–206.
2. M. J. Chung, O(n 2.5) time algorithms for the subgraph homeomorphism problem on trees, Journal of Algorithms 8, (1987), pp. 106–112.
3. M. Dubiner, Z. Galil, and E. Magen, Faster tree pattern matching, Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp. 145–150, 1990.
4. M. Farach and M. Thorup, Fast comparison of evolutionary trees, Proceedings of the Fifth Annual ACM-S1AM Symposium on Discrete Algorithms, pp. 481–488, 1994.
5. M. Farach and M. Thorup, Optimal evolutionary tree comparison by sparse dynamic programming, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 770–779, 1994.