Communications of the ACM
Information Processing Letters
Learning regular sets from queries and counterexamples
Information and Computation
Learning in the presence of malicious errors
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Inference of finite automata using homing sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on 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
Types of noise in data for concept learning
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Learning k-DNF with noise in the attributes
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
On learning from queries and counterexamples in the presence of noise
Information Processing Letters
Learning monotone DNF with an incomplete membership oracle
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Learning k-term DNF formulas with an incomplete membership oracle
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
A noise model on learning sets of strings
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Efficient learning of typical finite automata from random walks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient noise-tolerant learning from statistical queries
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Machine Learning
Learning with malicious membership queries and exceptions (extended abstract)
COLT '94 Proceedings of the seventh 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
Hi-index | 0.00 |