Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
On the equivalence between Berlekamp's and Euclid's algorithms
IEEE Transactions on Information Theory
Addition requirements for matrix and transposed matrix products
Journal of Algorithms
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
On the deterministic complexity of factoring polynomials over finite fields
Information Processing Letters
Constructing normal bases in finite fields
Journal of Symbolic Computation
Processor efficient parallel solution of linear systems over an abstract field
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
Factorization of polynomials over finite fields and characteristic sequences
Journal of Symbolic Computation
Fast construction of irreducible polynomials over finite fields
Journal of Symbolic Computation
Factoring high-degree polynomials by the black box Berlekamp algorithm
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Nearly optimal algorithms for canonical matrix forms
Nearly optimal algorithms for canonical matrix forms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Fast Algorithms for Manipulating Formal Power Series
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Arithmetic and factorization of polynomial over F2 (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Factoring modular polynomials (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Parallel distinct degree factorization algorithm
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Fast polynomial factorization over high algebraic extensions of finite fields
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
The black-box Niederreiter algorithm and its implementation over the binary field
Mathematics of Computation
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
Toward basing fully homomorphic encryption on worst-case hardness
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
| Hi-index | 0.00 |