How to construct random functions
Journal of the ACM (JACM)
A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Learning read-once formulas over fields and extended bases
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
Computational Complexity of Sparse Rational Interpolation
SIAM Journal on Computing
Effective Noether irreducibility forms and applications
Selected papers of the 23rd annual ACM symposium on Theory of computing
Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
Journal of Computer and System Sciences
Randomized Interpolation and Approximationof Sparse Polynomials
SIAM Journal on Computing
Learning Arithmetic Read-Once Formulas
SIAM Journal on Computing
Learning sparse multivariate polynomials over a field with queries and counterexamples
Journal of Computer and System Sciences
On some approximation problems concerning sparse polynomials over finite fields
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Interpolating Arithmetic Read-Once Formulas in Parallel
SIAM Journal on Computing
On interpolating arithmetic read-once formulas with exponentiation
Journal of Computer and System Sciences
On the efficiency of local decoding procedures for error-correcting codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Depth-3 arithmetic circuits over fields of characteristic zero
Computational Complexity
On Learning Programs and Small Depth Circuits
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds
Computational Complexity
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
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
Read-once polynomial identity testing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Affine projections of polynomials: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |