Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
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)
On the sample complexity of pac-learning using random and chosen examples
COLT '90 Proceedings of the third annual workshop on Computational learning theory
The learnability of formal concepts
COLT '90 Proceedings of the third annual workshop on Computational learning theory
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Machine learning: a theoretical approach
Machine learning: a theoretical approach
Computational learning theory: survey and selected bibliography
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Lower Bound Methods and Separation Results for On-Line Learning Models
Machine Learning - Computational learning theory
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Learning Conjunctive Concepts in Structural Domains
Machine Learning
Machine Learning
Machine Learning
Can Complexity Theory Benefit from Learning Theory?
ECML '93 Proceedings of the European Conference on Machine Learning
A Survey of Some Aspects of Computational Learning Theory (Extended Abstract)
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Simulating access to hidden information while learning
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved lower bounds for learning from noisy examples: an information-theoretic approach
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Application of a generalization of russo's formula to learning from multiple random oracles
Combinatorics, Probability and Computing
Distribution-free testing algorithms for monomials with a sublinear number of queries
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Hi-index | 0.02 |