| A linear space algorithm for computing maximal common subsequences DS Hirschberg Communications of the ACM 18 (6), 341-343, 1975 | 1777 | 1975 |
| Algorithms for the longest common subsequence problem DS Hirschberg Journal of the ACM (JACM) 24 (4), 664-675, 1977 | 1133 | 1977 |
| Data compression DA Lelewer, DS Hirschberg ACM Computing Surveys (CSUR) 19 (3), 261-296, 1987 | 675 | 1987 |
| Computing connected components on parallel computers DS Hirschberg, AK Chandra, DV Sarwate Communications of the ACM 22 (8), 461-464, 1979 | 386 | 1979 |
| Bounds on the complexity of the longest common subsequence problem JD Ullman, AV Aho, DS Hirschberg Journal of the ACM (JACM) 23 (1), 1-12, 1976 | 350 | 1976 |
| Decentralized extrema-finding in circular configurations of processors DS Hirschberg, JB Sinclair Communications of the ACM 23 (11), 627-628, 1980 | 274 | 1980 |
| A fast algorithm for optimal length-limited Huffman codes LL Larmore, DS Hirschberg Journal of the ACM (JACM) 37 (3), 464-473, 1990 | 194 | 1990 |
| Self-organizing linear search JH Hester, DS Hirschberg ACM Computing Surveys (CSUR) 17 (3), 295-311, 1985 | 194 | 1985 |
| Fast parallel sorting algorithms DS Hirschberg Communications of the ACM 21 (8), 657-661, 1978 | 158 | 1978 |
| Three-dimensional stabl matching problems C Ng, DS Hirschberg SIAM Journal on Discrete Mathematics 4 (2), 245-252, 1991 | 147 | 1991 |
| Approximate algorithms for some generalized knapsack problems AK Chandra, DS Hirschberg, CK Wong Theoretical Computer Science 3 (3), 293-304, 1976 | 123 | 1976 |
| An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes Kumar, Hirschberg IEEE Transactions on Computers 100 (3), 254-264, 1983 | 120 | 1983 |
| Efficient decoding of prefix codes DS Hirschberg, DA Lelewer Communications of the ACM 33 (4), 449-459, 1990 | 117 | 1990 |
| The least weight subsequence problem DS Hirschberg, LL Larmore SIAM Journal on Computing 16 (4), 628-638, 1987 | 115 | 1987 |
| Parallel algorithms for the transitive closure and the connected component problems DS Hirschberg Proceedings of the eighth annual ACM symposium on Theory of computing, 55-57, 1976 | 108 | 1976 |
| A class of dynamic memory allocation algorithms DS Hirschberg Communications of the ACM 16 (10), 615-618, 1973 | 98 | 1973 |
| A polynomial-time algorithm for the knapsack problem with two variables DS Hirschberg, CK Wong Journal of the ACM (JACM) 23 (1), 147-154, 1976 | 94 | 1976 |
| Geometric thickness of complete graphs MB Dillencourt, D Eppstein, DS Hirschberg Graph Algorithms And Applications 2, 39-51, 2004 | 89 | 2004 |
| Improved combinatorial group testing algorithms for real-world problem sizes D Eppstein, MT Goodrich, DS Hirschberg SIAM Journal on Computing 36 (5), 1360-1375, 2007 | 87 | 2007 |
| Serial computations of Levenshtein distances DS Hirschberg Pattern matching algorithms, 123-141, 1997 | 70 | 1997 |
