- A. V. Aho, D. S. Hirschberg, and J. D. Ullman. Bounds on the complexity of the longest
common subsequence problem. Journal of the ACM,
23(1):1-12, January 1976.
Citations.
- D. S. Hirschberg and C. K. Wong. A polynomial-time algorithm for
the knapsack problem with two variables. Journal of the
ACM, 23(1):147-154, January 1976.
Citations.
- Daniel S. Hirschberg. Algorithms for the longest
common subsequence problem. Journal of the ACM,
24(4):664-675, October 1977.
Citations.
- D. S. Hirschberg and L. L. Larmore. New applications of failure
functions. Journal of the ACM, 34(3):616-625, July
1987.
Citations.
- Lawrence L. Larmore and Daniel S. Hirschberg. A fast algorithm for optimal
length-limited Huffman codes. Journal of the ACM,
37(3):464-473, July 1990.
Citations.
Shortcuts: