Uniform closure properties of P-computable functions
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Computing with polynomials given by straight-line programs I: greatest common divisors
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A system for manipulating polynomials given by straight-line programs
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Feasible arithmetic computations: Valiant's hypothesis
Journal of Symbolic Computation
Greatest common divisors of polynomials given by straight-line programs
Journal of the ACM (JACM)
Functional decomposition ofpolynomials: the tame case
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Constructing normal bases in finite fields
Journal of Symbolic Computation
Effective Noether irreducibility forms and applications
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Computing Frobenius maps and factoring polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Dagwood: a system for manipulating polynomials given by straight-line programs
ACM Transactions on Mathematical Software (TOMS)
A numerical absolute primality test for bivariate polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Extended Hilbert irreducibility and its applications
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
Chinese Remaindering for Algebraic Numbers in a Hidden Field
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Polynomial factorization: a success story
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Absolute polynomial factorization in two variables and the knapsack problem
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Computational complexity of sentences over fields
Information and Computation
Counting reducible and singular bivariate polynomials
Finite Fields and Their Applications
Extracting sparse factors from multivariate integral polynomials
Journal of Symbolic Computation
| Hi-index | 0.00 |