Communications of the ACM
Primality and cryptography
One-way functions and Pseudorandom generators
Combinatorica - Theory of Computing
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A guided tour of Chernoff bounds
Information Processing Letters
The Strength of Weak Learnability
Machine Learning
Boosting a weak learning algorithm by majority
COLT '90 Proceedings of the third annual workshop on Computational learning theory
An O(nlog log n) learning algorithm for DNF under the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
An improved boosting algorithm and its implications on learning complexity
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Boosting and Hard-Core Set Construction
Machine Learning
On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Learning intersections and thresholds of halfspaces
Journal of Computer and System Sciences - Special issue on FOCS 2002
On uniform amplification of hardness in NP
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Foundations and Trends® in Theoretical Computer Science
Hi-index | 0.00 |