| 2016 | LATIN | From Discrepancy to Majority. | David Eppstein, Daniel S. Hirschberg |
| 2013 | WADS | Combinatorial Pair Testing: Distinguishing Workers from Slackers. | David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg |
| 2008 | DCC | Effective Compression of Monotone and Quasi-Monotone Sequences of Integers. | Daniel S. Hirschberg, Pierre Baldi |
| 2006 | SPAA | Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. | Michael T. Goodrich, Daniel S. Hirschberg |
| 2005 | WADS | Improved Combinatorial Group Testing for Real-World Problem Sizes. | David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg |
| 2001 | ISLPED | Low power address encoding using self-organizing lists. | Mahesh Mamidipaka, Daniel S. Hirschberg, Nikil D. Dutt |
| 1999 | CPM | Bounds on the Number of String Subsequences. | Daniel S. Hirschberg |
| 1998 | GD | Geometric Thickness of Complete Graphs. | Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg |
| 1994 | DCC | Parsing Algorithms for Dictionary Compression on the PRAM. | Daniel S. Hirschberg, Lynn M. Stauffer |
| 1992 | DCC | Transpose Coding on the Systolic Array. | Lynn M. Stauffer, Daniel S. Hirschberg |
| 1992 | ICML | Average Case Analysis of Learning kappa-CNF Concepts. | Daniel S. Hirschberg, Michael J. Pazzani |
| 1991 | DCC | Streamlining Context Models for Data Compression. | Debra A. Lelewer, Daniel S. Hirschberg |
| 1990 | SODA | Length-Limited Coding. | Lawrence L. Larmore, Daniel S. Hirschberg |
| 1985 | FOCS | The Least Weight Subsequence Problem (Extended Abstract) | Daniel S. Hirschberg, Lawrence L. Larmore |
| 1977 | FCT | Complexity of Common Subsequence Problems. | Daniel S. Hirschberg |
| 1976 | STOC | Parallel Algorithms for the Transitive Closure and the Connected Component Problems | Daniel S. Hirschberg |
| 1974 | FOCS | Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract) | Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman |