Hirschberg, Dan - School of Information and Computer Science, University of California, Irvine

• Tight Bounds on the Number of String Subsequences
• A Fast Algorithm for Optimal LengthLimited Huffman Codes Lawrence L. Larmore +# and Daniel S. Hirschberg #
• On the Complexity of Learning Decision Trees J. Kent Martin and D. S. Hirschberg
• Average Case Analysis of kCNF and kDNF learning algorithms
• The Time Complexity of Decision Tree Induction J. Kent Martin and D. S. Hirschberg
• STREAMLINING CONTEXT MODELS FOR DATA COMPRESSION Debra A. Lelewer and Daniel S. Hirschberg
• Average Case Analysis of Marking Algorithms D.S. Hirschberg + and L.L. Larmore #
• Low Power Address Encoding using SelfOrganizing Lists \Lambda Mahesh Mamidipaka
• Small Sample Statistics for Classification Error Rates II: Confidence Intervals and Significance Tests
• The Traveler's Problem D.S. Hirschberg and L.L. Larmore
• Finding Succinct Ordered Minimal Perfect
• Small Sample Statistics for Classification Error Rates I: Error Rate Measurements
• Improved Combinatorial Group Testing for RealWorld Problem Sizes
• SelfOrganizing Linear Search J. H. Hester and D. S. Hirschberg
• Choosing Subsets with Maximum Weighted Average David Eppstein Daniel S. Hirschberg
• Parallel Text Compression Lynn M. Stauffer
• Efficient Optimal Pagination of Scrolls L. L. Larmore
• IMPROVED UPDATE/QUERY ALGORITHMS FOR THE INTERVAL VALUATION PROBLEM D.S. Hirschberg and D.J. Volper
• Faster Construction of Optimal Binary Split Trees J. H. Hester
• SelfOrganizing Lists on the Xnet Lynn M. Stauffer
• Subtree Weight Ratios for Optimal Binary Search Trees D.S. Hirschberg
• An Intersection Inequality Sharper than the Tanimoto Triangle Inequality for Efficiently Searching Large Databases
• Algorithmica (1989) 4:503-510 Algorithmica9 1989Springer-VerlagNewYorkInc.
• SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics Vol. 36, No. 5, pp. 13601375
• Effective Compression of Monotone and Quasi-Monotone Sequences of Integers
• Constructing Problems of Geometric Combinatorics Daniel S. Hirschberg
• Data Compression Debra A. Lelewer and Daniel S. Hirschberg
• An Order2 Context Model for Data Compression With Reduced Time and Space Requirements
• Context Modeling for Text Compression Daniel S. Hirschbergy and Debra A. Lelewerz
• Lossless Compression of Chemical Fingerprints Using Integer Entropy Codes Improves Storage and Retrieval
• Hashing Algorithms and Data Structures for Rapid Searches of Fingerprint Vectors Ramzi Nasr, Daniel S. Hirschberg, and Pierre Baldi*
• SelfOrganizing Search Lists Using Probabilistic BackPointers J. H. Hester
• Speeding Up Chemical Database Searches Using a Proximity Filter Based on the Logical Exclusive OR
• Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities
• Serial Computations of Levenshtein In the previous chapters, we discussed problems involving an exact match
• Algorithmica (1987) 2:91-95 Algorithmica9 1987 Springer-Verlag New York Inc.
• Geometric Thickness of Complete Graphs Michael B. Dillencourt ? , David Eppstein ?? , Daniel S. Hirschberg
• Systolic Implementations for Transpose Coding Lynn M. Stauffer
• Efficient Decoding of Prefix Codes Daniel S. Hirschberg and Debra A. Lelewer
• A BoundedSpace Tree Traversal Algorithm D.S. Hirschberg + and S.S. Seiden +
• New Applications of Failure Functions D. S. Hirschberg
• Dictionary Compression on the PRAM Lynn M. Stauffer and Daniel S. Hirschberg
• INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #G07 THE MINIMUM SIZE REQUIRED OF A SOLITAIRE ARMY
• Lossless Compression of Chemical Fingerprints Using Integer Entropy Codes Improves Storage and Retrieval