Subquadratic-time factoring of polynomials over finite fields
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fast polynomial factorization over high algebraic extensions of finite fields
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Efficient computation of minimal polynomials in algebraic extensions of finite fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
High-order lifting and integrality certification
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
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
On lacunary polynomial perfect powers
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Finding paths of length k in O∗(2k) time
Information Processing Letters
Fast arithmetics in artin-schreier towers over finite fields
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
A parameterized view on matroid optimization problems
Theoretical Computer Science
Fast computation of special resultants
Journal of Symbolic Computation
transalpyne: a language for automatic transposition
ACM Communications in Computer Algebra
Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Almost linear time operations with triangular sets
ACM Communications in Computer Algebra
Detecting lacunary perfect powers and computing their roots
Journal of Symbolic Computation
A parameterized view on matroid optimization problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Genus 2 point counting over prime fields
Journal of Symbolic Computation
Fast arithmetics in Artin-Schreier towers over finite fields
Journal of Symbolic Computation
Fast arithmetic in unramified p-adic fields
Finite Fields and Their Applications
Tests for Permutation Functions
Finite Fields and Their Applications
Explicit Computation of Isomorphisms between Finite Fields
Finite Fields and Their Applications
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
Fast algorithms for l-adic towers over finite fields
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Matrix sparsification and nested dissection over arbitrary fields
Journal of the ACM (JACM)
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
| Hi-index | 0.00 |