Effective Noether irreducibility forms and applications
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Learning read-once formulas with queries
Journal of the ACM (JACM)
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Counting curves and their projections
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Learning sparse multivariate polynomials over a field with queries and counterexamples
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On computing sparse shifts for univariate polynomials
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Algorithms for computing sparse shifts for multivariate polynomials
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
On computing greatest common divisors with polynomials given by black boxes for their evaluations
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
A note on learning multivariate polynomials under the uniform distribution (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Checking polynomial identities over any field: towards a derandomization?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Interpolation of sparse multivariate polynomials over large finite fields with applications
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
IEEE Transactions on Computers
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
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Primality and identity testing via Chinese remaindering
Journal of the ACM (JACM)
Primality and Identity Testing via Chinese Remaindering
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Early termination in sparse interpolation algorithms
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
On reducing a system of equations to a single equation
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Symbolic-numeric sparse interpolation of multivariate polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
An efficient technique for synthesis and optimization of polynomials in GF(2m)
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields
IEEE Transactions on Computers
Read-once polynomial identity testing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
Interpolation of polynomials given by straight-line programs
Theoretical Computer Science
Parallel sparse polynomial interpolation over finite fields
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
A local decision test for sparse polynomials
Information Processing Letters
Applications of FFT and structured matrices
Algorithms and theory of computation handbook
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Sparse interpolation of multivariate rational functions
Theoretical Computer Science
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter
Proceedings of the forty-third annual ACM symposium on Theory of computing
Diversification improves interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
Testers and their applications
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.01 |