Daniel S. Hirschberg

Publication Activity (10 Years)

Years Active: 1973-2018
Publications (10 Years): 2

Top Topics

Failure Prediction

Human Resources

Top Venues

Publications

David Eppstein, Daniel S. Hirschberg
From Discrepancy to Majority. Algorithmica 80 (4) (2018)
David Eppstein, Daniel S. Hirschberg
From Discrepancy to Majority. LATIN (2016)
David Eppstein, Daniel S. Hirschberg
From Discrepancy to Majority. CoRR (2015)
David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
Combinatorial Pair Testing: Distinguishing Workers from Slackers CoRR (2013)
David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
Combinatorial Pair Testing: Distinguishing Workers from Slackers. WADS (2013)
Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler
Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. MedAlg (2012)
Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler
Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps CoRR (2011)
Ramzi Nasr, Daniel S. Hirschberg, Pierre Baldi
Hashing Algorithms and Data Structures for Rapid Searches of Fingerprint Vectors. J. Chem. Inf. Model. 50 (8) (2010)
Pierre Baldi, Daniel S. Hirschberg
An Intersection Inequality Sharper than the Tanimoto Triangle Inequality for Efficiently Searching Large Databases. J. Chem. Inf. Model. 49 (8) (2009)
Michael T. Goodrich, Daniel S. Hirschberg
Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis CoRR (2009)
Michael T. Goodrich, Daniel S. Hirschberg
Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis. J. Comb. Optim. 15 (1) (2008)
Daniel S. Hirschberg, Pierre Baldi
Effective Compression of Monotone and Quasi-Monotone Sequences of Integers. DCC (2008)
Pierre Baldi, Daniel S. Hirschberg, Ramzi Nasr
Speeding Up Chemical Database Searches Using a Proximity Filter Based on the Logical Exclusive OR. J. Chem. Inf. Model. 48 (7) (2008)
Pierre Baldi, Ryan W. Benz, Daniel S. Hirschberg, S. Joshua Swamidass
Lossless Compression of Chemical Fingerprints Using Integer Entropy Codes Improves Storage and Retrieval. J. Chem. Inf. Model. 47 (6) (2007)
David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comput. 36 (5) (2007)
Michael T. Goodrich, Daniel S. Hirschberg
Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. SPAA (2006)
George I. Bell, Daniel S. Hirschberg, Pablo Guerrero-García
The minimum size required of a solitaire army CoRR (2006)
David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS (2005)
David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes CoRR (2005)
Mahesh Mamidipaka, Daniel S. Hirschberg, Nikil D. Dutt
Adaptive low-power address encoding techniques using self-organizing lists. IEEE Trans. Very Large Scale Integr. Syst. 11 (5) (2003)
Nikil D. Dutt, Daniel S. Hirschberg, Mahesh Mamidipaka
Efficient Power Reduction Techniques for Time Multiplexed Address Buses. ISSS (2002)
Mahesh Mamidipaka, Daniel S. Hirschberg, Nikil D. Dutt
Low power address encoding using self-organizing lists. ISLPED (2001)
Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
Geometric Thickness of Complete Graphs. J. Graph Algorithms Appl. 4 (3) (2000)
Daniel S. Hirschberg
Bounds on the Number of String Subsequences. CPM (1999)
Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
Geometric Thickness of Complete Graphs CoRR (1999)
Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
Geometric Thickness of Complete Graphs. Graph Drawing (1998)
David Eppstein, Daniel S. Hirschberg
Choosing Subsets with Maximum Weighted Average. J. Algorithms 24 (1) (1997)
Daniel S. Hirschberg, Lynn M. Stauffer
Dictionary Compression on the PRAM. Parallel Process. Lett. 7 (3) (1997)
Lynn M. Stauffer, Daniel S. Hirschberg
Systolic Self-Organizing Lists Under Transpose. IEEE Trans. Parallel Distributed Syst. 6 (1) (1995)
Daniel S. Hirschberg, Lynn M. Stauffer
Parsing Algorithms for Dictionary Compression on the PRAM. Data Compression Conference (1994)
Steven S. Seiden, Daniel S. Hirschberg
Finding Succinct Ordered Minimal Perfect Hash Functions. Inf. Process. Lett. 51 (6) (1994)
Lynn M. Stauffer, Daniel S. Hirschberg
PRAM Algorithms for Static Dictionary Compression. IPPS (1994)
Daniel S. Hirschberg, Steven S. Seiden
A Bounded-Space Tree Traversal Algorithm. Inf. Process. Lett. 47 (4) (1993)
Daniel S. Hirschberg, Lawrence L. Larmore
The Traveler's Problem. J. Algorithms 13 (1) (1992)
Daniel S. Hirschberg, Michael J. Pazzani
Average Case Analysis of Learning kappa-CNF Concepts. ML (1992)
Lynn M. Stauffer, Daniel S. Hirschberg
Transpose Coding on the Systolic Array. Data Compression Conference (1992)
Debra A. Lelewer, Daniel S. Hirschberg
Streamlining Context Models for Data Compression. Data Compression Conference (1991)
Cheng Ng, Daniel S. Hirschberg
Three-Dimensional Stable Matching Problems. SIAM J. Discret. Math. 4 (2) (1991)
Daniel S. Hirschberg, Debra A. Lelewer
Efficient Decoding of Prefix Codes. Commun. ACM 33 (4) (1990)
Lawrence L. Larmore, Daniel S. Hirschberg
Length-Limited Coding. SODA (1990)
Lawrence L. Larmore, Daniel S. Hirschberg
A Fast Algorithm for Optimal Length-Limited Huffman Codes J. ACM 37 (3) (1990)
Cheng Ng, Daniel S. Hirschberg
Lower Bounds for the Stable Marriage Problem and its Variants. SIAM J. Comput. 19 (1) (1990)
Daniel S. Hirschberg, Lawrence L. Larmore
The Set-Set LCS Problem. Algorithmica 4 (4) (1989)
James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore
Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. J. Algorithms 9 (2) (1988)
Daniel S. Hirschberg, Lawrence L. Larmore
New applications of failure functions. J. ACM 34 (3) (1987)
Debra A. Lelewer, Daniel S. Hirschberg
Data Compression. ACM Comput. Surv. 19 (3) (1987)
Daniel S. Hirschberg, Lawrence L. Larmore
The Least Weight Subsequence Problem. SIAM J. Comput. 16 (4) (1987)
James H. Hester, Daniel S. Hirschberg
Self-Organizing Search Lists Using Probabilistic Back-Pointers. Commun. ACM 30 (12) (1987)
Daniel S. Hirschberg, Dennis J. Volper
Improved Update/Query Algorithms for the Interval Valuation Problem. Inf. Process. Lett. 24 (5) (1987)
Daniel S. Hirschberg, Lawrence L. Larmore
The Set LCS Problem. Algorithmica 2 (1987)
Daniel S. Hirschberg, Lawrence L. Larmore
Average Case Analysis of Marking Algorithms. SIAM J. Comput. 15 (4) (1986)
James H. Hester, Daniel S. Hirschberg, S.-H. H. Huang, C. K. Wong
Faster Construction of Optimal Binary Split Trees. J. Algorithms 7 (3) (1986)
Lawrence L. Larmore, Daniel S. Hirschberg
Efficient Optimal Pagination of Scrolls. Commun. ACM 28 (8) (1985)
Daniel S. Hirschberg, Lawrence L. Larmore
The Least Weight Subsequence Problem (Extended Abstract) FOCS (1985)
James H. Hester, Daniel S. Hirschberg
Self-Organizing Linear Search. ACM Comput. Surv. 17 (3) (1985)
Manoj Kumar, Daniel S. Hirschberg
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes. IEEE Trans. Computers 32 (3) (1983)
Daniel S. Hirschberg
On the Complexity of Searching a Set of Vectors. SIAM J. Comput. 9 (1) (1980)
Daniel S. Hirschberg, James B. Sinclair
Decentralized Extrema-Finding in Circular Configurations of Processors. Commun. ACM 23 (11) (1980)
Daniel S. Hirschberg, C. K. Wong
Upper and lower bounds for graph-diameter problems with application to record allocation. J. Comb. Theory, Ser. B 26 (1) (1979)
Daniel S. Hirschberg, Ashok K. Chandra, Dilip V. Sarwate
Computing Connected Components on Parallel Computers. Commun. ACM 22 (8) (1979)
Daniel S. Hirschberg
Fast Parallel Sorting Algorithms. Commun. ACM 21 (8) (1978)
A. K. Chandra, Daniel S. Hirschberg, C. K. Wong
Bin Packing with Geometric Constraints in Computer Network Design. Oper. Res. 26 (5) (1978)
Daniel S. Hirschberg
An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem. Inf. Process. Lett. 7 (1) (1978)
Daniel S. Hirschberg
Algorithms for the Longest Common Subsequence Problem. J. ACM 24 (4) (1977)
Daniel S. Hirschberg
Complexity of Common Subsequence Problems. FCT (1977)
Daniel S. Hirschberg, C. K. Wong
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables. J. ACM 23 (1) (1976)
Daniel S. Hirschberg
Parallel Algorithms for the Transitive Closure and the Connected Component Problems STOC (1976)
Daniel S. Hirschberg
An Insertion Technique for One-Sided Height-Balanced Trees. Commun. ACM 19 (8) (1976)
Ashok K. Chandra, Daniel S. Hirschberg, C. K. Wong
Approximate Algorithms for Some Generalized Knapsack Problems. Theor. Comput. Sci. 3 (3) (1976)
Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman
Bounds on the Complexity of the Longest Common Subsequence Problem. J. ACM 23 (1) (1976)
Daniel S. Hirschberg
A Linear Space Algorithm for Computing Maximal Common Subsequences. Commun. ACM 18 (6) (1975)
Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman
Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract) SWAT (1974)
Daniel S. Hirschberg
A Class of Dynamic Memory Allocation Algorithms. Commun. ACM 16 (10) (1973)