9 citations · 14 across the 2 of their papers we have counts for
3 papers
cs.DS2003★ 5 cited
Computing the Number of Longest Common Subsequences
Ronald I. Greenberg
This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embed…
cs.DM2003★ 9 cited
Bounds on the Number of Longest Common Subsequences
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…
cs.DC2001
On the Area of Hypercube Layouts
Ronald I. Greenberg, Lee Guan
This paper precisely analyzes the wire density and required area in standard layout styles for the hypercube. The most natural, regular layout of a hypercube of N^2 nodes in the pl…