default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel S. Hirschberg
Person information
- affiliation: University of California, Irvine, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j46]David Eppstein, Daniel S. Hirschberg:
From Discrepancy to Majority. Algorithmica 80(4): 1278-1297 (2018)- 2016
- [c20]David Eppstein, Daniel S. Hirschberg:
From Discrepancy to Majority. LATIN 2016: 390-402 - 2015
- [i7]David Eppstein, Daniel S. Hirschberg:
From Discrepancy to Majority. CoRR abs/1512.06488 (2015) - 2013
- [c19]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg:
Combinatorial Pair Testing: Distinguishing Workers from Slackers. WADS 2013: 316-327 - [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) - 2010
- [j45]Ramzi Nasr, Daniel S. Hirschberg, Pierre Baldi:
Hashing Algorithms and Data Structures for Rapid Searches of Fingerprint Vectors. J. Chem. Inf. Model. 50(8): 1358-1368 (2010)
2000 – 2009
- 2009
- [j44]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): 1866-1870 (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
- [j43]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): 1367-1378 (2008) - [j42]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
- [j41]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): 2098-2109 (2007) - [j40]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
- [j39]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): 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 D. Dutt:
Low power address encoding using self-organizing lists. ISLPED 2001: 188-193 - 2000
- [j38]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]Daniel S. Hirschberg:
Bounds on the Number of String Subsequences. CPM 1999: 115-122 - [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. GD 1998: 101-110 - 1997
- [j37]David Eppstein, Daniel S. Hirschberg:
Choosing Subsets with Maximum Weighted Average. J. Algorithms 24(1): 177-193 (1997) - [j36]Daniel S. Hirschberg, Lynn M. Stauffer:
Dictionary Compression on the PRAM. Parallel Process. Lett. 7(3): 297-308 (1997) - [p1]Daniel S. Hirschberg:
Serial computations of Levenshtein distances. Pattern Matching Algorithms 1997: 123-141 - 1996
- [e1]Daniel S. Hirschberg, Eugene W. Myers:
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 [contents] - 1995
- [j35]Lynn M. Stauffer, Daniel S. Hirschberg:
Systolic Self-Organizing Lists Under Transpose. IEEE Trans. Parallel Distributed Syst. 6(1): 102-105 (1995) - 1994
- [j34]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
- [j33]Daniel S. Hirschberg, Steven S. Seiden:
A Bounded-Space Tree Traversal Algorithm. Inf. Process. Lett. 47(4): 215-219 (1993) - 1992
- [j32]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
- [j31]Cheng Ng, Daniel S. Hirschberg:
Three-Dimensional Stable Matching Problems. SIAM J. Discret. 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
- [j30]Daniel S. Hirschberg, Debra A. Lelewer:
Efficient Decoding of Prefix Codes. Commun. ACM 33(4): 449-459 (1990) - [j29]Lawrence L. Larmore, Daniel S. Hirschberg:
A Fast Algorithm for Optimal Length-Limited Huffman Codes. J. ACM 37(3): 464-473 (1990) - [j28]Cheng Ng, Daniel S. Hirschberg:
Lower Bounds for the Stable Marriage Problem and its Variants. SIAM J. Comput. 19(1): 71-77 (1990) - [c5]Lawrence L. Larmore, Daniel S. Hirschberg:
Length-Limited Coding. SODA 1990: 310-318
1980 – 1989
- 1989
- [j27]Daniel S. Hirschberg, Lawrence L. Larmore:
The Set-Set LCS Problem. Algorithmica 4(4): 503-510 (1989) - 1988
- [j26]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
- [j25]Daniel S. Hirschberg, Lawrence L. Larmore:
The Set LCS Problem. Algorithmica 2: 91-95 (1987) - [j24]James H. Hester, Daniel S. Hirschberg:
Self-Organizing Search Lists Using Probabilistic Back-Pointers. Commun. ACM 30(12): 1074-1079 (1987) - [j23]Debra A. Lelewer, Daniel S. Hirschberg:
Data Compression. ACM Comput. Surv. 19(3): 261-296 (1987) - [j22]Daniel S. Hirschberg, Dennis J. Volper:
Improved Update/Query Algorithms for the Interval Valuation Problem. Inf. Process. Lett. 24(5): 307-310 (1987) - [j21]Daniel S. Hirschberg, Lawrence L. Larmore:
New applications of failure functions. J. ACM 34(3): 616-625 (1987) - [j20]Daniel S. Hirschberg, Lawrence L. Larmore:
The Least Weight Subsequence Problem. SIAM J. Comput. 16(4): 628-638 (1987) - 1986
- [j19]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) - [j18]Daniel S. Hirschberg, Lawrence L. Larmore:
Average Case Analysis of Marking Algorithms. SIAM J. Comput. 15(4): 1069-1074 (1986) - 1985
- [j17]Lawrence L. Larmore, Daniel S. Hirschberg:
Efficient Optimal Pagination of Scrolls. Commun. ACM 28(8): 854-856 (1985) - [j16]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
- [j15]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
- [j14]Daniel S. Hirschberg, James B. Sinclair:
Decentralized Extrema-Finding in Circular Configurations of Processors. Commun. ACM 23(11): 627-628 (1980) - [j13]Daniel S. Hirschberg:
On the Complexity of Searching a Set of Vectors. SIAM J. Comput. 9(1): 126-129 (1980)
1970 – 1979
- 1979
- [j12]Daniel S. Hirschberg, Ashok K. Chandra, Dilip V. Sarwate:
Computing Connected Components on Parallel Computers. Commun. ACM 22(8): 461-464 (1979) - [j11]Daniel S. Hirschberg, C. K. Wong:
Upper and lower bounds for graph-diameter problems with application to record allocation. J. Comb. Theory B 26(1): 66-74 (1979) - 1978
- [j10]Daniel S. Hirschberg:
Fast Parallel Sorting Algorithms. Commun. ACM 21(8): 657-661 (1978) - [j9]A. K. Chandra, Daniel S. Hirschberg, C. K. Wong:
Bin Packing with Geometric Constraints in Computer Network Design. Oper. Res. 26(5): 760-772 (1978) - [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]Daniel S. Hirschberg:
Complexity of Common Subsequence Problems. FCT 1977: 393-398 - 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 1974: 104-109 - 1973
- [j1]Daniel S. Hirschberg:
A Class of Dynamic Memory Allocation Algorithms. Commun. ACM 16(10): 615-618 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
