Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract) - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman. Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract). In 15th Annual Symposium on Switching and Automata Theory, 14-16 October 1974, The University of New Orleans, USA. pages 104-109, IEEE, 1974.

Identified as Alfred V. Aho This author has not been identified. Look up 'Daniel S. Hirschberg' in GoogleThis author has not been identified. Look up 'Jeffrey D. Ullman' in Google

runs on WebDSL