Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/jacm/AhoHU76
%A Aho, Alfred V.
%A Hirschberg, Daniel S.
%A Ullman, Jeffrey D.
%D 1976
%J J. ACM
%K dblp
%N 1
%P 1-12
%T Bounds on the Complexity of the Longest Common Subsequence Problem.
%U http://dblp.uni-trier.de/db/journals/jacm/jacm23.html#AhoHU76
%V 23
@article{journals/jacm/AhoHU76,
added-at = {2018-11-06T00:00:00.000+0100},
author = {Aho, Alfred V. and Hirschberg, Daniel S. and Ullman, Jeffrey D.},
biburl = {https://www.bibsonomy.org/bibtex/235cc0bc4820caed53d01d0661b2f9944/dblp},
ee = {https://doi.org/10.1145/321921.321922},
interhash = {33835da42169e5bfe45cf2d60af287fa},
intrahash = {35cc0bc4820caed53d01d0661b2f9944},
journal = {J. ACM},
keywords = {dblp},
number = 1,
pages = {1-12},
timestamp = {2018-11-07T12:10:04.000+0100},
title = {Bounds on the Complexity of the Longest Common Subsequence Problem.},
url = {http://dblp.uni-trier.de/db/journals/jacm/jacm23.html#AhoHU76},
volume = 23,
year = 1976
}