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
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
Invariant and geometric aspects of algebraic complexity theory I
Journal of Symbolic Computation
Subquadratic-time factoring of polynomials over finite fields
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient computation of minimal polynomials in algebraic extensions of finite fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Adapted diameters and the efficient computation of Fourier transforms on finite groups
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast construction of irreducible polynomials over finite fields
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Tellegen's principle into practice
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
A Strassen-like matrix multiplication suited for squaring and higher power computation
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |