Communications of the ACM
Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
Learning regular sets from queries and counterexamples
Information and Computation
Combinatorica - Theory of Computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Computational limitations on learning from examples
Journal of the ACM (JACM)
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
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Random DFA's can be approximately learned from sparse uniform examples
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
Learning fallible finite state automata
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Learning probabilistic automata with variable memory length
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Exploiting random walks for learning
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
On the learnability and usage of acyclic probabilistic finite automata
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
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Exactly Learning Automata of Small Cover Time
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
Learning bias and phonological-rule induction
Computational Linguistics
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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)
Exploration Strategies for Model-based Learning in Multi-agent Systems: Exploration Strategies
Autonomous Agents and Multi-Agent Systems
A Parallel Algorithm for Minimization of Finite Automata
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Exploiting random walks for learning
Information and Computation
Inducing grammars from sparse data sets: a survey of algorithms and results
The Journal of Machine Learning Research
Looping suffix tree-based inference of partially observable hidden state
ICML '06 Proceedings of the 23rd international conference on Machine learning
MARS: A metamodel recovery system using grammar inference
Information and Software Technology
Kernel methods for learning languages
Theoretical Computer Science
Learning linearly separable languages
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
| Hi-index | 0.00 |