Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
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
Subquadratic-time factoring of polynomials over finite fields
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fast rectangular matrix multiplications and improving parallel matrix computations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
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)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
QUARTZ, 128-Bit Long Digital Signatures
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Polynomial factorization over F2
Mathematics of Computation
Computer algebra handbook
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations
IEEE Transactions on Computers
Fast polynomial factorization and modular composition in small characteristic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
transalpyne: a language for automatic transposition
ACM Communications in Computer Algebra
Genus 2 point counting over prime fields
Journal of Symbolic Computation
Fast Polynomial Factorization and Modular Composition
SIAM Journal on Computing
| Hi-index | 0.00 |