Communications of the ACM
How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How to construct random functions
Journal of the ACM (JACM)
Information Processing Letters
Learning regular sets from queries and counterexamples
Information and Computation
Learning from good and bad data
Learning from good and bad data
Computational limitations on learning from examples
Journal of the ACM (JACM)
A general lower bound on the number of examples needed for learning
Information and Computation
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Elements of information theory
Elements of information theory
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
General bounds on the number of examples needed for learning probabilistic concepts
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
On the sample complexity of noise-tolerant learning
Information Processing Letters
Computational sample complexity
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Synthesizers and their application to the parallel construction of pseudo-random functions
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Computational sample complexity
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Computational sample complexity and attribute-efficient learning
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
| Hi-index | 0.00 |