Communications of the ACM
Bounds for width two branching programs
SIAM Journal on Computing
Information Processing Letters
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The computational complexity of machine learning
The computational complexity of machine learning
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
SIAM Journal on Computing
Learning &mgr;-branching programs with queries
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On learning bounded-width branching programs
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Machine Learning
Machine Learning
Machine Learning
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Machine Learning
Learning Intermediate Concepts
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor
Information Processing Letters
An efficient query learning algorithm for ordered binary decision diagrams
Information and Computation
An efficient query learning algorithm for ordered binary decision diagrams
Information and Computation
| Hi-index | 0.01 |