1. Robert E. Schapire The Strength of Weak Learnability Symposium on Foundations of Computer Science 1989, 28–33.
2. Occam's Razor Information Processing letters 24;Blumer,1987
3. Haussler, Kearns, Littlestone & Warmuth Equivalence for models of polynomial learnability proceeding of the 1988 Workshop on Computational Learning Theory, pages 42–55, Morgan-Kaufmann, Cambridge, MA, August 1988.
4. Blumer, Ehrenfeucht, Haussler & Warmuth Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. Proc. 18th ACM Symp. on Theory of Computation, Berkeley, CA., 1986, 343–370.
5. Kearns & Valiant Cryptographic limitations on learning formulae and finite automata. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pages 433–444, Seattle, Washington, May 1989.