Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Daniel S. Hirschberg
2010 – today
- 2013
[i6]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Combinatorial Pair Testing: Distinguishing Workers from Slackers. CoRR abs/1305.0110 (2013)- 2012
- [c18]Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler: Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. MedAlg 2012: 203-218
- 2011
- [i5]Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler: Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps. CoRR abs/1107.4378 (2011)
2000 – 2009
- 2009
- [i4]Michael T. Goodrich, Daniel S. Hirschberg: Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis. CoRR abs/0905.1906 (2009)
- 2008
- [j40]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)
- [c17]Daniel S. Hirschberg, Pierre Baldi: Effective Compression of Monotone and Quasi-Monotone Sequences of Integers. DCC 2008: 520
- 2007
- [j39]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
- [c16]Michael T. Goodrich, Daniel S. Hirschberg: Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. SPAA 2006: 118-127
- [i3]George I. Bell, Daniel S. Hirschberg, Pablo Guerrero-García: The minimum size required of a solitaire army. CoRR abs/math/0612612 (2006)
- 2005
- [c15]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS 2005: 86-98
- [i2]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. CoRR abs/cs/0505048 (2005)
- 2003
- [j38]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
- [c14]Nikil D. Dutt, Daniel S. Hirschberg, Mahesh Mamidipaka: Efficient Power Reduction Techniques for Time Multiplexed Address Buses. ISSS 2002: 207-212
- 2001
- [c13]Mahesh Mamidipaka, Daniel S. Hirschberg, Nikil Dutt: Low power address encoding using self-organizing lists. ISLPED 2001: 188-193
- 2000
- [j37]Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. J. Graph Algorithms Appl. 4(3): 5-17 (2000)
1990 – 1999
- 1999
- [c12]
- [i1]Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. CoRR math.CO/9910185 (1999)
- 1998
- [c11]Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. Graph Drawing 1998: 101-110
- 1997
- [j36]David Eppstein, Daniel S. Hirschberg: Choosing Subsets with Maximum Weighted Average. J. Algorithms 24(1): 177-193 (1997)
- [j35]Daniel S. Hirschberg, Lynn M. Stauffer: Dictionary Compression on the PRAM. Parallel Processing Letters 7(3): 297-308 (1997)
- 1996
- [e1]Daniel S. Hirschberg, Eugene W. Myers (Eds.): Combinatorial Pattern Matching, 7th Annual Symposium, CPM 96, Laguna Beach, California, USA, June 10-12, 1996, Proceedings. Lecture Notes in Computer Science 1075, Springer 1996, ISBN 3-540-61258-0
- 1995
- [j34]Lynn M. Stauffer, Daniel S. Hirschberg: Systolic Self-Organizing Lists Under Transpose. IEEE Trans. Parallel Distrib. Syst. 6(1): 102-105 (1995)
- 1994
- [j33]Steven S. Seiden, Daniel S. Hirschberg: Finding Succinct Ordered Minimal Perfect Hash Functions. Inf. Process. Lett. 51(6): 283-288 (1994)
- [c10]Daniel S. Hirschberg, Lynn M. Stauffer: Parsing Algorithms for Dictionary Compression on the PRAM. Data Compression Conference 1994: 136-145
- [c9]Lynn M. Stauffer, Daniel S. Hirschberg: PRAM Algorithms for Static Dictionary Compression. IPPS 1994: 344-348
- 1993
- [j32]Daniel S. Hirschberg, Steven S. Seiden: A Bounded-Space Tree Traversal Algorithm. Inf. Process. Lett. 47(4): 215-219 (1993)
- 1992
- [j31]Daniel S. Hirschberg, Lawrence L. Larmore: The Traveler's Problem. J. Algorithms 13(1): 148-160 (1992)
- [c8]Lynn M. Stauffer, Daniel S. Hirschberg: Transpose Coding on the Systolic Array. Data Compression Conference 1992: 162-171
- [c7]Daniel S. Hirschberg, Michael J. Pazzani: Average Case Analysis of Learning kappa-CNF Concepts. ML 1992: 206-211
- 1991
- [j30]Cheng Ng, Daniel S. Hirschberg: Three-Dimensional Stable Matching Problems. SIAM J. Discrete Math. 4(2): 245-252 (1991)
- [c6]Debra A. Lelewer, Daniel S. Hirschberg: Streamlining Context Models for Data Compression. Data Compression Conference 1991: 313-322
- 1990
- [j29]Daniel S. Hirschberg, Debra A. Lelewer: Efficient Decoding of Prefix Codes. Commun. ACM 33(4): 449-459 (1990)
- [j28]Lawrence L. Larmore, Daniel S. Hirschberg: A Fast Algorithm for Optimal Length-Limited Huffman Codes. J. ACM 37(3): 464-473 (1990)
- [j27]Cheng Ng, Daniel S. Hirschberg: Lower Bounds for the Stable Marriage Problem and its Variants. SIAM J. Comput. 19(1): 71-77 (1990)
- [c5]
1980 – 1989
- 1989
- [j26]Daniel S. Hirschberg, Lawrence L. Larmore: The Set-Set LCS Problem. Algorithmica 4(4): 503-510 (1989)
- 1988
- [j25]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
- [j24]
- [j23]James H. Hester, Daniel S. Hirschberg: Self-Organizing Search Lists Using Probabilistic Back-Pointers. Commun. ACM 30(12): 1074-1079 (1987)
- [j22]
- [j21]Daniel S. Hirschberg, Dennis J. Volper: Improved Update/Query Algorithms for the Interval Valuation Problem. Inf. Process. Lett. 24(5): 307-310 (1987)
- [j20]Daniel S. Hirschberg, Lawrence L. Larmore: New applications of failure functions. J. ACM 34(3): 616-625 (1987)
- [j19]Daniel S. Hirschberg, Lawrence L. Larmore: The Least Weight Subsequence Problem. SIAM J. Comput. 16(4): 628-638 (1987)
- 1986
- [j18]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)
- [j17]Daniel S. Hirschberg, Lawrence L. Larmore: Average Case Analysis of Marking Algorithms. SIAM J. Comput. 15(4): 1069-1074 (1986)
- 1985
- [j16]Lawrence L. Larmore, Daniel S. Hirschberg: Efficient Optimal Pagination of Scrolls. Commun. ACM 28(8): 854-856 (1985)
- [j15]James H. Hester, Daniel S. Hirschberg: Self-Organizing Linear Search. ACM Comput. Surv. 17(3): 295-311 (1985)
- [c4]Daniel S. Hirschberg, Lawrence L. Larmore: The Least Weight Subsequence Problem (Extended Abstract). FOCS 1985: 137-143
- 1983
- [j14]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
- [j13]Daniel S. Hirschberg, J. B. Sinclair: Decentralized Extrema-Finding in Circular Configurations of Processors. Commun. ACM 23(11): 627-628 (1980)
- [j12]Daniel S. Hirschberg: On the Complexity of Searching a Set of Vectors. SIAM J. Comput. 9(1): 126-129 (1980)
1970 – 1979
- 1979
- [j11]Daniel S. Hirschberg, Ashok K. Chandra, Dilip V. Sarwate: Computing Connected Components on Parallel Computers. Commun. ACM 22(8): 461-464 (1979)
- [j10]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
- [j9]
- [j8]Daniel S. Hirschberg: An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem. Inf. Process. Lett. 7(1): 40-41 (1978)
- 1977
- [j7]Daniel S. Hirschberg: Algorithms for the Longest Common Subsequence Problem. J. ACM 24(4): 664-675 (1977)
- [c3]
- 1976
- [j6]Daniel S. Hirschberg: An Insertion Technique for One-Sided Height-Balanced Trees. Commun. ACM 19(8): 471-473 (1976)
- [j5]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)
- [j4]Daniel S. Hirschberg, C. K. Wong: A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables. J. ACM 23(1): 147-154 (1976)
- [j3]Ashok K. Chandra, Daniel S. Hirschberg, C. K. Wong: Approximate Algorithms for Some Generalized Knapsack Problems. Theor. Comput. Sci. 3(3): 293-304 (1976)
- [c2]Daniel S. Hirschberg: Parallel Algorithms for the Transitive Closure and the Connected Component Problems. STOC 1976: 55-57
- 1975
- [j2]Daniel S. Hirschberg: A Linear Space Algorithm for Computing Maximal Common Subsequences. Commun. ACM 18(6): 341-343 (1975)
- 1974
- [c1]Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman: Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract). SWAT (FOCS) 1974: 104-109
- 1973
- [j1]Daniel S. Hirschberg: A Class of Dynamic Memory Allocation Algorithms. Commun. ACM 16(10): 615-618 (1973)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-03 20:12 CEST by the dblp team