D. S. Hirschberg
University of California, Irvine · 47 works · 2,734 citations · h-index 18
Top works
- A linear space algorithm for computing maximal common subsequences
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Computing connected components on parallel computers
- Bounds on the complexity of the longest common subsequence problem
- Decentralized extrema-finding in circular configurations of processors
- Fast parallel sorting algorithms
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- Parallel algorithms for the transitive closure and the connected component problems
- Self-organizing linear search
- Approximate algorithms for some generalized knapsack problems
- The Least Weight Subsequence Problem
- An information-theoretic lower bound for the longest common subsequence problem
- An insertion technique for one-sided height-balanced trees
- Efficient optimal pagination of scrolls
- New applications of failure functions
- The time complexity of decision tree induction
- Small sample statistics for classification error rates I: error rate measurements
- Streamlining context models for data compression
- On the Complexity of Searching a Set of Vectors
- Serial Computations of Levenshtein Distances