Probabilistic inductive inference
Journal of the ACM (JACM)
Breaking the probability ½ barrier in FIN-type learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On learning multiple concepts in parallel
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Capabilities of probabilistic learners with bounded mind changes
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Probability is more powerful than team for language identification from positive data
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Capabilities of fallible FINite learning
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
The strength of noninclusions for teams of finite learners (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Choosing a learning team: a topological approach
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the impact of forgetting on learning machines
Journal of the ACM (JACM)
Probabilistic and team PFIN-type learning: general properties
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Probabilistic inductive inference: a survey
Theoretical Computer Science
Hierarchies of probabilistic and team FIN -learning
Theoretical Computer Science
Closedness properties in ex-identification
Theoretical Computer Science - Algorithmic learning theory
Avoiding coding tricks by hyperrobust learning
Theoretical Computer Science
Avoiding Coding Tricks by Hyperrobust Learning
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Closedness Properties in EX-Identification of Recursive Functions
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning to Win Process-Control Games Watching Game-Masters
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
PAC learning of probability distributions over a discrete domain
Theoretical Computer Science
Journal of Computer and System Sciences
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Capabilities of Thoughtful Machines
Fundamenta Informaticae
Probabilistic and team PFIN-type learning: General properties
Journal of Computer and System Sciences
Taming teams with mind changes
Journal of Computer and System Sciences
Quantum inductive inference by finite automata
Theoretical Computer Science
Absolute versus probabilistic classification in a logical setting
Theoretical Computer Science
Input-Dependence in Function-Learning
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Learning Behaviors of Functions
Fundamenta Informaticae
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Absolute versus probabilistic classification in a logical setting
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Capabilities of Thoughtful Machines
Fundamenta Informaticae
Learning Via Queries With Teams And Anomalies
Fundamenta Informaticae
Learning Behaviors of Functions with Teams
Fundamenta Informaticae
| Hi-index | 0.01 |