• Publications
  • Influence
A linear space algorithm for computing maximal common subsequences
The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadratic time and in linearExpand
Algorithms for the Longest Common Subsequence Problem
A lgor i thm is appl icable in the genera l case and requi res O ( p n + n log n) t ime for any input strings o f lengths m and n even though the lower bound on T ime of O ( m n ) need not apply to all inputs. Expand
Self-organizing linear search
Algorithms that modify the order of linear search lists are surveyed and algorithms in the literature with absolute analyses when available are presented. Expand
A fast algorithm for optimal length-limited Huffman codes
An O(nL))-time algorithm is introduced for constructing an optimal Huffman code for a weighted alphabet of size n, where each code string must have length no greater than L. Expand
Three-Dimensional Stable Matching Problems
The approach developed in this paper provides an alternate NP-completeness proof for the hospitals/residents problem with couples—an important practical problem shown earlier to be NP-complete by Ronn. Expand
Bounds on the Complexity of the Longest Common Subsequence Problem
It is shown that unless a bound on the total number of distinct symbols is assumed, every solution to the problem can consume an amount of time that is proportional to the product of the lengths of the two strings. Expand
The least weight subsequence problem
  • D. Hirschberg, L. Larmore
  • Mathematics, Computer Science
  • 26th Annual Symposium on Foundations of Computer…
  • 1 August 1987
The least weight subsequence (LWS) problem is introduced, and is shown to be equivalent to the classic minimum path problem for directed graphs, and to be solvable in O(n log n) time generally and, for certain weight functions, in linear time. Expand
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
Efficient nonadaptive and two-stage combinatorial group testing algorithms, which identify the at most $d$ items out of a given set of $n$ items that are defective, using fewer tests for all practical set sizes are presented. Expand
Computing connected components on parallel computers
A parallel algorithm which uses n=2 processors to find the connected components of an undirected graph with n vertices in time in time O(n), which can be used to finding the transitive closure of a symmetric Boolean matrix. Expand
Approximate Algorithms for Some Generalized Knapsack Problems
The main result can be described as follows: for every e 0 one can construct a polynomial-time algorithm for each of the above problems such that the ratio of the value of the objective function by this algorithm and the optimal value is bounded below by 1 - e. Expand