Finding irreducible polynomials over finite fields
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
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
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Tests for permutation polynomials
SIAM Journal on Computing
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
Computing Frobenius maps and factoring polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |