| 2008 |
|---|
| 61 | EE | Daniel S. Hirschberg,
Pierre Baldi:
Effective Compression of Monotone and Quasi-Monotone Sequences of Integers.
DCC 2008: 520 |
| 60 | EE | 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): 95-121 (2008) |
| 2007 |
|---|
| 59 | EE | David Eppstein,
Michael T. Goodrich,
Daniel S. Hirschberg:
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes.
SIAM J. Comput. 36(5): 1360-1375 (2007) |
| 2006 |
|---|
| 58 | EE | Michael T. Goodrich,
Daniel S. Hirschberg:
Efficient parallel algorithms for dead sensor diagnosis and multiple access channels.
SPAA 2006: 118-127 |
| 57 | EE | George I. Bell,
Daniel S. Hirschberg,
Pablo Guerrero-García:
The minimum size required of a solitaire army
CoRR abs/math/0612612: (2006) |
| 2005 |
|---|
| 56 | EE | David Eppstein,
Michael T. Goodrich,
Daniel S. Hirschberg:
Improved Combinatorial Group Testing for Real-World Problem Sizes.
WADS 2005: 86-98 |
| 55 | EE | David Eppstein,
Michael T. Goodrich,
Daniel S. Hirschberg:
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
CoRR abs/cs/0505048: (2005) |
| 2003 |
|---|
| 54 | EE | Mahesh Mamidipaka,
Daniel S. Hirschberg,
Nikil D. Dutt:
Adaptive low-power address encoding techniques using self-organizing lists.
IEEE Trans. VLSI Syst. 11(5): 827-834 (2003) |
| 2002 |
|---|
| 53 | EE | Nikil D. Dutt,
Daniel S. Hirschberg,
Mahesh Mamidipaka:
Efficient Power Reduction Techniques for Time Multiplexed Address Buses.
ISSS 2002: 207-212 |
| 2001 |
|---|
| 52 | EE | Mahesh Mamidipaka,
Daniel S. Hirschberg,
Nikil Dutt:
Low power address encoding using self-organizing lists.
ISLPED 2001: 188-193 |
| 2000 |
|---|
| 51 | EE | Michael B. Dillencourt,
David Eppstein,
Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs.
J. Graph Algorithms Appl. 4(3): 5-17 (2000) |
| 1999 |
|---|
| 50 | EE | Daniel S. Hirschberg:
Bounds on the Number of String Subsequences.
CPM 1999: 115-122 |
| 49 | EE | Michael B. Dillencourt,
David Eppstein,
Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs
CoRR math.CO/9910185: (1999) |
| 1998 |
|---|
| 48 | EE | Michael B. Dillencourt,
David Eppstein,
Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs.
Graph Drawing 1998: 101-110 |
| 1997 |
|---|
| 47 | | David Eppstein,
Daniel S. Hirschberg:
Choosing Subsets with Maximum Weighted Average.
J. Algorithms 24(1): 177-193 (1997) |
| 46 | | Daniel S. Hirschberg,
Lynn M. Stauffer:
Dictionary Compression on the PRAM.
Parallel Processing Letters 7(3): 297-308 (1997) |
| 1996 |
|---|
| 45 | | Daniel S. Hirschberg,
Eugene W. Myers:
Combinatorial Pattern Matching, 7th Annual Symposium, CPM 96, Laguna Beach, California, USA, June 10-12, 1996, Proceedings
Springer 1996 |
| 1995 |
|---|
| 44 | EE | Lynn M. Stauffer,
Daniel S. Hirschberg:
Systolic Self-Organizing Lists Under Transpose.
IEEE Trans. Parallel Distrib. Syst. 6(1): 102-105 (1995) |
| 1994 |
|---|
| 43 | | Daniel S. Hirschberg,
Lynn M. Stauffer:
Parsing Algorithms for Dictionary Compression on the PRAM.
Data Compression Conference 1994: 136-145 |
| 42 | | Lynn M. Stauffer,
Daniel S. Hirschberg:
PRAM Algorithms for Static Dictionary Compression.
IPPS 1994: 344-348 |
| 41 | | Steven S. Seiden,
Daniel S. Hirschberg:
Finding Succinct Ordered Minimal Perfect Hash Functions.
Inf. Process. Lett. 51(6): 283-288 (1994) |
| 1993 |
|---|
| 40 | | Daniel S. Hirschberg,
Steven S. Seiden:
A Bounded-Space Tree Traversal Algorithm.
Inf. Process. Lett. 47(4): 215-219 (1993) |
| 1992 |
|---|
| 39 | | Lynn M. Stauffer,
Daniel S. Hirschberg:
Transpose Coding on the Systolic Array.
Data Compression Conference 1992: 162-171 |
| 38 | | Daniel S. Hirschberg,
Michael J. Pazzani:
Average Case Analysis of Learning kappa-CNF Concepts.
ML 1992: 206-211 |
| 37 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
The Traveler's Problem.
J. Algorithms 13(1): 148-160 (1992) |
| 1991 |
|---|
| 36 | | Debra A. Lelewer,
Daniel S. Hirschberg:
Streamlining Context Models for Data Compression.
Data Compression Conference 1991: 313-322 |
| 35 | | Cheng Ng,
Daniel S. Hirschberg:
Three-Dimensional Stable Matching Problems.
SIAM J. Discrete Math. 4(2): 245-252 (1991) |
| 1990 |
|---|
| 34 | | Lawrence L. Larmore,
Daniel S. Hirschberg:
Length-Limited Coding.
SODA 1990: 310-318 |
| 33 | | Daniel S. Hirschberg,
Debra A. Lelewer:
Efficient Decoding of Prefix Codes.
Commun. ACM 33(4): 449-459 (1990) |
| 32 | EE | Lawrence L. Larmore,
Daniel S. Hirschberg:
A Fast Algorithm for Optimal Length-Limited Huffman Codes
J. ACM 37(3): 464-473 (1990) |
| 31 | | Cheng Ng,
Daniel S. Hirschberg:
Lower Bounds for the Stable Marriage Problem and its Variants.
SIAM J. Comput. 19(1): 71-77 (1990) |
| 1989 |
|---|
| 30 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
The Set-Set LCS Problem.
Algorithmica 4(4): 503-510 (1989) |
| 1988 |
|---|
| 29 | | 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): 245-253 (1988) |
| 1987 |
|---|
| 28 | EE | Debra A. Lelewer,
Daniel S. Hirschberg:
Data Compression.
ACM Comput. Surv. 19(3): 261-296 (1987) |
| 27 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
The Set LCS Problem.
Algorithmica 2: 91-95 (1987) |
| 26 | | James H. Hester,
Daniel S. Hirschberg:
Self-Organizing Search Lists Using Probabilistic Back-Pointers.
Commun. ACM 30(12): 1074-1079 (1987) |
| 25 | | Daniel S. Hirschberg,
Dennis J. Volper:
Improved Update/Query Algorithms for the Interval Valuation Problem.
Inf. Process. Lett. 24(5): 307-310 (1987) |
| 24 | EE | Daniel S. Hirschberg,
Lawrence L. Larmore:
New applications of failure functions.
J. ACM 34(3): 616-625 (1987) |
| 23 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
The Least Weight Subsequence Problem.
SIAM J. Comput. 16(4): 628-638 (1987) |
| 1986 |
|---|
| 22 | | James H. Hester,
Daniel S. Hirschberg,
S.-H. H. Huang,
C. K. Wong:
Faster Construction of Optimal Binary Split Trees.
J. Algorithms 7(3): 412-424 (1986) |
| 21 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
Average Case Analysis of Marking Algorithms.
SIAM J. Comput. 15(4): 1069-1074 (1986) |
| 1985 |
|---|
| 20 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
The Least Weight Subsequence Problem (Extended Abstract)
FOCS 1985: 137-143 |
| 19 | | James H. Hester,
Daniel S. Hirschberg:
Self-Organizing Linear Search.
ACM Comput. Surv. 17(3): 295-311 (1985) |
| 18 | | Lawrence L. Larmore,
Daniel S. Hirschberg:
Efficient Optimal Pagination of Scrolls.
Commun. ACM 28(8): 854-856 (1985) |
| 1983 |
|---|
| 17 | | 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): 254-264 (1983) |
| 1980 |
|---|
| 16 | | Daniel S. Hirschberg,
J. B. Sinclair:
Decentralized Extrema-Finding in Circular Configurations of Processors.
Commun. ACM 23(11): 627-628 (1980) |
| 15 | | Daniel S. Hirschberg:
On the Complexity of Searching a Set of Vectors.
SIAM J. Comput. 9(1): 126-129 (1980) |
| 1979 |
|---|
| 14 | | Daniel S. Hirschberg,
Ashok K. Chandra,
Dilip V. Sarwate:
Computing Connected Components on Parallel Computers.
Commun. ACM 22(8): 461-464 (1979) |
| 13 | EE | 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): 66-74 (1979) |
| 1978 |
|---|
| 12 | | Daniel S. Hirschberg:
Fast Parallel Sorting Algorithms.
Commun. ACM 21(8): 657-661 (1978) |
| 11 | | Daniel S. Hirschberg:
An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem.
Inf. Process. Lett. 7(1): 40-41 (1978) |
| 1977 |
|---|
| 10 | | Daniel S. Hirschberg:
Complexity of Common Subsequence Problems.
FCT 1977: 393-398 |
| 9 | EE | Daniel S. Hirschberg:
Algorithms for the Longest Common Subsequence Problem.
J. ACM 24(4): 664-675 (1977) |
| 1976 |
|---|
| 8 | | Daniel S. Hirschberg:
Parallel Algorithms for the Transitive Closure and the Connected Component Problems
STOC 1976: 55-57 |
| 7 | | Daniel S. Hirschberg:
An Insertion Technique for One-Sided Height-Balanced Trees.
Commun. ACM 19(8): 471-473 (1976) |
| 6 | EE | Alfred V. Aho,
Daniel S. Hirschberg,
Jeffrey D. Ullman:
Bounds on the Complexity of the Longest Common Subsequence Problem.
J. ACM 23(1): 1-12 (1976) |
| 5 | EE | Daniel S. Hirschberg,
C. K. Wong:
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables.
J. ACM 23(1): 147-154 (1976) |
| 4 | | Ashok K. Chandra,
Daniel S. Hirschberg,
C. K. Wong:
Approximate Algorithms for Some Generalized Knapsack Problems.
Theor. Comput. Sci. 3(3): 293-304 (1976) |
| 1975 |
|---|
| 3 | | Daniel S. Hirschberg:
A Linear Space Algorithm for Computing Maximal Common Subsequences.
Commun. ACM 18(6): 341-343 (1975) |
| 1974 |
|---|
| 2 | | Alfred V. Aho,
Daniel S. Hirschberg,
Jeffrey D. Ullman:
Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract)
FOCS 1974: 104-109 |
| 1973 |
|---|
| 1 | | Daniel S. Hirschberg:
A Class of Dynamic Memory Allocation Algorithms.
Commun. ACM 16(10): 615-618 (1973) |
