Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Near-optimal sparse fourier representations via sampling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Derandomizing homomorphism testing in general groups
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Interpolation of polynomials given by straight-line programs
Theoretical Computer Science
Pseudorandom Bit Generators That Fool Modular Sums
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A local decision test for sparse polynomials
Information Processing Letters
On the derandomization of the graph test for homomorphism over groups
Theoretical Computer Science
| Hi-index | 0.89 |