Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The parallel complexity of exponentiating polynomials over finite fields
Journal of the ACM (JACM)
Very fast parallel polynomial arithmetic
SIAM Journal on Computing
Efficient exponentiation in finite fields (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
On representations by low-degree polynomials
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Affine dispersers from subspace polynomials
Proceedings of the forty-first annual ACM symposium on Theory of computing
Constant-Depth circuits for arithmetic in finite fields of characteristic two
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Algebraic methods in randomness and pseudorandomness
Algebraic methods in randomness and pseudorandomness
Efficiently constructible huge graphs that preserve first order properties of random graphs
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
| Hi-index | 0.00 |