On the power of learning robustly
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On a generalized notion of mistake bounds
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Reflective Inductive Inference of Recursive Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Robust Learning - Rich and Poor
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Merging Uniform Inductive Learners
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Separation of uniform learning classes
Theoretical Computer Science - Special issue: Algorithmic learning theory
Learning all subfunctions of a function
Information and Computation
Robust learning: rich and poor
Journal of Computer and System Sciences
From learning in the limit to stochastic finite learning
Theoretical Computer Science - Algorithmic learning theory
Results on memory-limited U-shaped learning
Information and Computation
Learning and extending sublanguages
Theoretical Computer Science
Learning recursive functions: A survey
Theoretical Computer Science
Reflective inductive inference of recursive functions
Theoretical Computer Science
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Numberings Optimal for Learning
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Consistent and coherent learning with δ-delay
Information and Computation
On some open problems in reflective inductive inference
Information Processing Letters
Hypothesis Spaces for Learning
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Consistency conditions for inductive inference of recursive functions
JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence
Numberings optimal for learning
Journal of Computer and System Sciences
Independence results for n-ary recursion theorems
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Hypothesis spaces for learning
Information and Computation
Robust learning of automatic classes of languages
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Inductive inference and language learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Confident and consistent partial learning of recursive functions
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Robust learning of automatic classes of languages
Journal of Computer and System Sciences
| Hi-index | 0.01 |