Author:
Gupta Arvind,Nishimura Naomi
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. A. Apostolico, S. Browne and C. Guerra, Fast linear-space computations of longest common subsequence, Theoretical Computer Science 92 (1992), pp. 3–17.
2. H. Alblas, Iteration of transformation passes over attributed program trees, Acta-Informatica 27 (1989), pp. 1–40.
3. R. Brent, The parallel evaluation of general arithmetic expressions, Journal of the ACM 21, 2 (1974), pp. 201–206.
4. M. J. Chung, O(n 2.5) time algorithms for the subgraph homeomorphism problem on trees, Journal of Algorithms 8, (1987), pp. 106–112.
5. S. Cook, A. Gupta, and V. Ramachandran, A fast parallel algorithm for formula evaluation, unpublished manuscript, October 1986.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finding smallest supertrees;Algorithms and Computations;1995