Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Addition requirements for matrix and transposed matrix products
Journal of Algorithms
A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Fast construction of irreducible polynomials over finite fields
Journal of Symbolic Computation
A new polynomial factorization algorithm and its implementation
Journal of Symbolic Computation
Fast Algorithms for Manipulating Formal Power Series
Journal of the ACM (JACM)
Tellegen's principle into practice
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Approximate radical of ideals with clusters of roots
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Change of order for bivariate triangular sets
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Fast polynomial factorization and modular composition in small characteristic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Quasi-quadratic elliptic curve point counting using rigid cohomology
Journal of Symbolic Computation
Fast arithmetics in artin-schreier towers over finite fields
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Fast computation of special resultants
Journal of Symbolic Computation
Fast arithmetics in Artin-Schreier towers over finite fields
Journal of Symbolic Computation
Testing nilpotence of galois groups in polynomial time
ACM Transactions on Algorithms (TALG)
Fast Polynomial Factorization and Modular Composition
SIAM Journal on Computing
On the complexity of computing with zero-dimensional triangular sets
Journal of Symbolic Computation
Inversion modulo zero-dimensional regular chains
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.01 |