104
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
120
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
105
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
Many studies have shown that the imbalance of network channel traffic is of critical effect on the overall performance of multicomputer systems. In this paper, we analytically mode...
131
Voted
CSR
2006
Springer
15 years 6 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...