Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman. Bounds on the Complexity of the Longest Common Subsequence Problem. Journal of the ACM, 23(1):1-12, 1976. [doi]