A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
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
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Polylogarithmic Independence Can Fool DNF Formulas
SIAM Journal on Computing
Polylogarithmic independence fools AC0 circuits
Journal of the ACM (JACM)
On the expressive power of deep architectures
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Candidate weak pseudorandom functions in AC0 ○ MOD2
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 48.22 |