9 citations · 14 across the 2 of their papers we have counts for
1 paper · 1 filter
Ronald I. Greenberg
This paper performs the analysis necessary to bound the running time of known, efficient algorithms for generating all longest common subsequences. That is, we bound the running ti…