On-line learning of linear functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Computational learning theory: survey and selected bibliography
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Learning hierarchical rule sets
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learning read-once formulas with queries
Journal of the ACM (JACM)
Efficient learning of typical finite automata from random walks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Parameterized learning complexity
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Learning fallible finite state automata
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Diversity-based inference of finite automata
Journal of the ACM (JACM)
Learning from a consistently ignorant teacher
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Inductive logic programming and learnability
ACM SIGART Bulletin
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On learning bounded-width branching programs
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Exactly learning automata with small cover time
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Learning Sat-k-DNF formulas from membership queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
PAC learning intersections of halfspaces with membership queries (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Approximating hyper-rectangles: learning and pseudo-random sets
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A dichotomy theorem for learning quantified Boolean formulas
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Exact learning of tree patterns from queries and counterexamples
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Hardness Results for Learning First-Order Representations and Programming by Demonstration
Machine Learning - Special issue on the ninth annual conference on computational theory (COLT '96)
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the intrinsic complexity of learning recursive functions
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
Theoretical Computer Science - Algorithmic learning theory
SIGACT News complexity theory column 32
ACM SIGACT News
Efficient distribution-free population learning of simple concepts
Annals of Mathematics and Artificial Intelligence
On learning unions of pattern languages and tree patterns in the mistake bound model
Theoretical Computer Science
On the Learnability of Hidden Markov Models
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Consistent Polynominal Identification in the Limit
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
On Learning Unions of Pattern Languages and Tree Patterns
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
On the Hardness of Learning Acyclic Conjunctive Queries
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Efficient Learning of Semi-structured Data from Queries
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Learning elementary formal systems with queries
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
On the intrinsic complexity of learning recursive functions
Information and Computation
Learnability of quantified formulas
Theoretical Computer Science
Error limiting reductions between classification tasks
ICML '05 Proceedings of the 22nd international conference on Machine learning
Random Embedding Machines for Pattern Recognition
Neural Computation
Prediction-hardness of acyclic conjunctive queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Minimizing nfa's and regular expressions
Journal of Computer and System Sciences
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Pac-learning recursive logic programs: negative results
Journal of Artificial Intelligence Research
Information and Computation
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Partial observability and learnability
Artificial Intelligence
Cryptographic limitations on learning one-clause logic programs
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Algorithms and theory of computation handbook
Lower bounds on learning random structures with statistical queries
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
On exact learning from random walk
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Exact learning composed classes with a small number of mistakes
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Minimizing NFA's and regular expressions
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On the learnability of shuffle ideals
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
On the learnability of shuffle ideals
The Journal of Machine Learning Research
| Hi-index | 0.00 |