Rank-r decision trees are a subclass of r-decision lists

On self-directed learning

COLT '95 Proceedings of the eighth annual conference on Computational learning theory

On learning decision trees with large output domains (extended abstract)

COLT '95 Proceedings of the eighth annual conference on Computational learning theory

Towards the learnability of DNF formulae

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Online Learning versus Offline Learning

Machine Learning

Self-Directed Learning and Its Relation to the VC-Dimension and to Teacher-Directed Learning

Machine Learning

Learning DNF in time

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Learnability beyond AC0

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

Algebraic Characterizations of Small Classes of Boolean Functions

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science

On online learning of decision lists

The Journal of Machine Learning Research

Learning DNF in time 2õ(n1/3)

Journal of Computer and System Sciences - STOC 2001

Learning mixtures of product distributions over discrete domains

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Toward Attribute Efficient Learning of Decision Lists and Parities

The Journal of Machine Learning Research

Extremal properties of polynomial threshold functions

Journal of Computer and System Sciences

Exact learning composed classes with a small number of mistakes

COLT'06 Proceedings of the 19th annual conference on Learning Theory

On PAC learning algorithms for rich boolean function classes

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation