1. Learnability and the Vapnik-Chervonenkis dimension;Blumer;Journal of the Association for Computing Machinery,1989
2. Bonnie Eisenberg and Ronald L. Rivest On the sample complexity of pac-learning using random and chosen examples. In Proceedings of the Third Annual Workshop on Computational Learning Theory, Morgan Kaufmann, August 1990.
3. Yoav Freund Boosting a weak learning algorithm by majority. In Proceedings of the Third Annual Workshop on Computational Learning Theory. Morgan Kaufmann, August 1990.
4. David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth. Equivalence of models for polynomial learnability. In Proceedings of the 1988 Workshop on Computation Learning Theory, pages 42–55. Morgan Kaufmann, August 1988.