1. A decision-theoretic generalization of on-line learning and application to boosting;Freund;Proceedings of the Second European Conference on Computaional Learning Theory,1995
2. .Freund, R. Shapire. A decision-theoretic generalization of on-line learning and application to boosting. Journal of Computer and System Sciences, 1997(55):119-139.
3. A Short Introduction to Boosting;Freund;Journal of Japanese Society for Artificial Intelligence,1999
4. Learning Boolean formulae or finite automata is as hard as factoring;Michael Kearns;Technical Report TR-14-88, Harvard University Aiken Computation Laboratory,1988
5. Cryptographic limitation on learning Boolean formulae and finite automata;Michael Kearns;Journal of the Association for Computing Machinery,1994