22 search results - page 1 / 5 » An O(M(n) log n) algorithm for the Jacobi symbol |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
FMCAD
2000
Springer
13 years 9 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
TPDS
1998
13 years 5 months ago
1998
—A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...