A Class of Dynamic Memory Allocation Algorithms. - Daniel S. Hirschberg (Commun. ACM, 1973)

Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract) - Alfred V. Aho; Daniel S. Hirschberg; Jeffrey D. Ullman (SWAT, 1974)

A Linear Space Algorithm for Computing Maximal Common Subsequences. - Daniel S. Hirschberg (Commun. ACM, 1975)

Parallel Algorithms for the Transitive Closure and the Connected Component Problems - Daniel S. Hirschberg (STOC, 1976)

An Insertion Technique for One-Sided Height-Balanced Trees. - Daniel S. Hirschberg (Commun. ACM, 1976)

Bounds on the Complexity of the Longest Common Subsequence Problem. - Alfred V. Aho; Daniel S. Hirschberg; Jeffrey D. Ullman (J. ACM, 1976)

A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables. - Daniel S. Hirschberg; C. K. Wong (J. ACM, 1976)

Approximate Algorithms for Some Generalized Knapsack Problems. - Ashok K. Chandra; Daniel S. Hirschberg; C. K. Wong (Theor. Comput. Sci., 1976)

Complexity of Common Subsequence Problems. - Daniel S. Hirschberg (FCT, 1977)

Algorithms for the Longest Common Subsequence Problem. - Daniel S. Hirschberg (J. ACM, 1977)

Fast Parallel Sorting Algorithms. - Daniel S. Hirschberg (Commun. ACM, 1978)

Bin Packing with Geometric Constraints in Computer Network Design. - A. K. Chandra; Daniel S. Hirschberg; C. K. Wong (Oper. Res., 1978)

An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem. - Daniel S. Hirschberg (Inf. Process. Lett., 1978)

Computing Connected Components on Parallel Computers. - Daniel S. Hirschberg; Ashok K. Chandra; Dilip V. Sarwate (Commun. ACM, 1979)

Upper and lower bounds for graph-diameter problems with application to record allocation. - Daniel S. Hirschberg; C. K. Wong (J. Comb. Theory B, 1979)

Decentralized Extrema-Finding in Circular Configurations of Processors. - Daniel S. Hirschberg; James B. Sinclair (Commun. ACM, 1980)

On the Complexity of Searching a Set of Vectors. - Daniel S. Hirschberg (SIAM J. Comput., 1980)

An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes. - Manoj Kumar; Daniel S. Hirschberg (IEEE Trans. Computers, 1983)

The Least Weight Subsequence Problem (Extended Abstract) - Daniel S. Hirschberg; Lawrence L. Larmore (FOCS, 1985)

Efficient Optimal Pagination of Scrolls. - Lawrence L. Larmore; Daniel S. Hirschberg (Commun. ACM, 1985)

Self-Organizing Linear Search. - James H. Hester; Daniel S. Hirschberg (ACM Comput. Surv., 1985)

Faster Construction of Optimal Binary Split Trees. - James H. Hester; Daniel S. Hirschberg; S.-H. H. Huang; C. K. Wong (J. Algorithms, 1986)

Average Case Analysis of Marking Algorithms. - Daniel S. Hirschberg; Lawrence L. Larmore (SIAM J. Comput., 1986)

The Set LCS Problem. - Daniel S. Hirschberg; Lawrence L. Larmore (Algorithmica, 1987)

Self-Organizing Search Lists Using Probabilistic Back-Pointers. - James H. Hester; Daniel S. Hirschberg (Commun. ACM, 1987)

Data Compression. - Debra A. Lelewer; Daniel S. Hirschberg (ACM Comput. Surv., 1987)

Improved Update/Query Algorithms for the Interval Valuation Problem. - Daniel S. Hirschberg; Dennis J. Volper (Inf. Process. Lett., 1987)

New applications of failure functions. - Daniel S. Hirschberg; Lawrence L. Larmore (J. ACM, 1987)

The Least Weight Subsequence Problem. - Daniel S. Hirschberg; Lawrence L. Larmore (SIAM J. Comput., 1987)

Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. - James H. Hester; Daniel S. Hirschberg; Lawrence L. Larmore (J. Algorithms, 1988)

The Set-Set LCS Problem. - Daniel S. Hirschberg; Lawrence L. Larmore (Algorithmica, 1989)

Length-Limited Coding. - Lawrence L. Larmore; Daniel S. Hirschberg (SODA, 1990)

Efficient Decoding of Prefix Codes. - Daniel S. Hirschberg; Debra A. Lelewer (Commun. ACM, 1990)

Lower Bounds for the Stable Marriage Problem and its Variants. - Cheng Ng; Daniel S. Hirschberg (SIAM J. Comput., 1990)

A Fast Algorithm for Optimal Length-Limited Huffman Codes - Lawrence L. Larmore; Daniel S. Hirschberg (J. ACM, 1990)

Streamlining Context Models for Data Compression. - Debra A. Lelewer; Daniel S. Hirschberg (Data Compression Conference, 1991)

Three-Dimensional Stable Matching Problems. - Cheng Ng; Daniel S. Hirschberg (SIAM J. Discret. Math., 1991)

Transpose Coding on the Systolic Array. - Lynn M. Stauffer; Daniel S. Hirschberg (Data Compression Conference, 1992)

Average Case Analysis of Learning kappa-CNF Concepts. - Daniel S. Hirschberg; Michael J. Pazzani (ML, 1992)

The Traveler's Problem. - Daniel S. Hirschberg; Lawrence L. Larmore (J. Algorithms, 1992)

A Bounded-Space Tree Traversal Algorithm. - Daniel S. Hirschberg; Steven S. Seiden (Inf. Process. Lett., 1993)

Parsing Algorithms for Dictionary Compression on the PRAM. - Daniel S. Hirschberg; Lynn M. Stauffer (Data Compression Conference, 1994)

PRAM Algorithms for Static Dictionary Compression. - Lynn M. Stauffer; Daniel S. Hirschberg (IPPS, 1994)

Finding Succinct Ordered Minimal Perfect Hash Functions. - Steven S. Seiden; Daniel S. Hirschberg (Inf. Process. Lett., 1994)

Systolic Self-Organizing Lists Under Transpose. - Lynn M. Stauffer; Daniel S. Hirschberg (IEEE Trans. Parallel Distributed Syst., 1995)

Serial computations of Levenshtein distances. - Daniel S. Hirschberg (Pattern Matching Algorithms, 1997)

Choosing Subsets with Maximum Weighted Average. - David Eppstein; Daniel S. Hirschberg (J. Algorithms, 1997)

Dictionary Compression on the PRAM. - Daniel S. Hirschberg; Lynn M. Stauffer (Parallel Process. Lett., 1997)

Bounds on the Number of String Subsequences. - Daniel S. Hirschberg (CPM, 1999)

Geometric Thickness of Complete Graphs. - Michael B. Dillencourt; David Eppstein; Daniel S. Hirschberg (J. Graph Algorithms Appl., 2000)

Low power address encoding using self-organizing lists. - Mahesh Mamidipaka; Daniel S. Hirschberg; Nikil D. Dutt (ISLPED, 2001)

Efficient Power Reduction Techniques for Time Multiplexed Address Buses. - Nikil D. Dutt; Daniel S. Hirschberg; Mahesh Mamidipaka (ISSS, 2002)

Adaptive low-power address encoding techniques using self-organizing lists. - Mahesh Mamidipaka; Daniel S. Hirschberg; Nikil D. Dutt (IEEE Trans. Very Large Scale Integr. Syst., 2003)

Improved Combinatorial Group Testing for Real-World Problem Sizes. - David Eppstein; Michael T. Goodrich; Daniel S. Hirschberg (WADS, 2005)

Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. - Michael T. Goodrich; Daniel S. Hirschberg (SPAA, 2006)

The minimum size required of a solitaire army - George I. Bell; Daniel S. Hirschberg; Pablo Guerrero-García (CoRR, 2006)

Lossless Compression of Chemical Fingerprints Using Integer Entropy Codes Improves Storage and Retrieval. - Pierre Baldi; Ryan W. Benz; Daniel S. Hirschberg; S. Joshua Swamidass (J. Chem. Inf. Model., 2007)

Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. - David Eppstein; Michael T. Goodrich; Daniel S. Hirschberg (SIAM J. Comput., 2007)

Effective Compression of Monotone and Quasi-Monotone Sequences of Integers. - Daniel S. Hirschberg; Pierre Baldi (DCC, 2008)

Speeding Up Chemical Database Searches Using a Proximity Filter Based on the Logical Exclusive OR. - Pierre Baldi; Daniel S. Hirschberg; Ramzi Nasr (J. Chem. Inf. Model., 2008)

Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis. - Michael T. Goodrich; Daniel S. Hirschberg (J. Comb. Optim., 2008)

An Intersection Inequality Sharper than the Tanimoto Triangle Inequality for Efficiently Searching Large Databases. - Pierre Baldi; Daniel S. Hirschberg (J. Chem. Inf. Model., 2009)

Hashing Algorithms and Data Structures for Rapid Searches of Fingerprint Vectors. - Ramzi Nasr; Daniel S. Hirschberg; Pierre Baldi (J. Chem. Inf. Model., 2010)

Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps - Michael T. Goodrich; Daniel S. Hirschberg; Michael Mitzenmacher; Justin Thaler (CoRR, 2011)

Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. - Michael T. Goodrich; Daniel S. Hirschberg; Michael Mitzenmacher; Justin Thaler (MedAlg, 2012)

Combinatorial Pair Testing: Distinguishing Workers from Slackers. - David Eppstein; Michael T. Goodrich; Daniel S. Hirschberg (WADS, 2013)

From Discrepancy to Majority. - David Eppstein; Daniel S. Hirschberg (Algorithmica, 2018)

Combinatorial Drone Searching. - Ofek Gila; Michael T. Goodrich; Zahra Hadizadeh; Daniel S. Hirschberg; Shayan Taherijam (CoRR, 2025)

The Rectilinear Marco Polo Problem. - Ofek Gila; Michael T. Goodrich; Zahra Hadizadeh; Daniel S. Hirschberg; Shayan Taherijam (CoRR, 2025)