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
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
Adaptive versus nonadaptive attribute-efficient learning
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The query complexity of finding local minima in the lattice
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On feasible multivariate polynomial interpolations over arbitrary fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
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)
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The query complexity of finding local minima in the lattice
Information and Computation
Adaptive Versus Nonadaptive Attribute-Efficient Learning
Machine Learning
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
IEEE Transactions on Computers
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
On reducing a system of equations to a single equation
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
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
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
A local decision test for sparse polynomials
Information Processing Letters
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
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Testers and their applications
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 5.24 |