cora	auer1995a	 Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R.   Gambling in a rigged casino: The adversial multi-armed bandit problem.   (1995).   In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 
cora	auer1995a	 Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R.   Gambling in a rigged casino: The adversial multi-armed bandit problem.   (1995).   In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 
cora	auer1995a	 P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire,   "Gambling in a rigged casino: the adversarial multi-armed bandit problem,"   1995,   in Proc. 36th Annual Symposium on Foundations of Computer Science, 
cora	blum1993	 A. Blum, M. Furst, M. J. Kearns, and Richard J. Lipton.   Cryptographic primitives based on hard learning problems.   1993.   In Pre-Proceedings of CRYPTO '93, 
cora	blum1993	 Avrim Blum, Merrick Furst, Michael Kearns, and Richard J. Lipton.   Cryptographic primitives based on hard learning problems.   1993.   In Pre-Proceedings of CRYPTO '93, 
cora	blum1993	 Avrim Blum, Merrick Furst, Michael Kearns, and Richard J. Lipton.   Cryptographic primitives based on hard learning problems.   1993.   In Pre-Proceedings of CRYPTO '93, 
cora	blum1993	 Avrim Blum, Merrick Furst, Michael Kearns, and Richard J. Lipton.   Cryptographic primitives based on hard learning problems.   1994.   Proc. CRYPTO 93, 
cora	blum1993	 A. Blum, M. Furst, M. Kearns, R. Lipton.   Cryptographic Primitives Based on Hard Learning Problems.   1993.   CRYPTO, 
cora	blum1993	 A. Blum, M. Furst, M. Kearns, R. Lipton.   Cryptographic Primitives Based on Hard Learning Problems.   1993.   CRYPTO, 
cora	blum1993	 A. Blum, M. Furst, M. Kearns, R. Lipton.   Cryptographic Primitives Based on Hard Learning Problems.   1993.   CRYPTO, 
cora	blum1994	 Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., & Rudich, S.   Weakly learning DNF and Characterizing Statistical Query learning using Fourier analysis.   (1994).   Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 
cora	blum1994	 Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., & Rudich, S.   Weakly learning DNF and Characterizing Statistical Query learning using Fourier analysis.   (1994).   Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 
cora	blum1994	 Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., & Rudich, S.   Weakly learning DNF and Characterizing Statistical Query learning using Fourier analysis.   (1994).   Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 
cora	blum1994	 Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., & Rudich, S.   Weakly learning DNF and Characterizing Statistical Query learning using Fourier analysis.   (1994).   Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 
cora	blum1994	 Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., & Rudich, S.   Weakly learning DNF and characterizing statistical query learning using fourier analysis.   (1994).   In Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, 
cora	blum1994	 Blum A., Furst M., Jackson J., Kearns M., Mansour Y., and Rudich S.   Weakly learning DNF 10 and characterizing statistical query learning using fourier analysis.   1994.   In Proc. 26th Annu. ACM Sympos. Theory Comput. 
cora	blum1994	 A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich.   Weakly learning DNF and characterizing statistical query learning using Fourier analysis.   1994.   In Proceedings of the 26th ACM Symposium on the Theory of Computing. 
cora	blum1994	 A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich.   Weakly learning DNF and characterizing statistical query learning using Fourier analysis.   1994.   In Proceedings of the 26th ACM Symposium on the Theory of Computing. 
cora	blum1994	 A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich.   Weakly learning DNF and characterizing statistical query learning using Fourier analysis.   1994.   In Proceedings of the 26th ACM Symposium on the Theory of Computing. 
cora	blum1994	 Avrim Blum, Merrick Furst, Jeffrey Jackson, Michael Kearns, Yishay Mansour, and Steven Rudich.   Weakly learning DNF and characterizing statistical query learning using fourier analysis.   1994.   In T he 26 th Annual ACM Symposium on T heory of Computing, 
cora	blum1994	 Avrim Blum, Merrick Furst, Jeffery Jackson, Michael Kearns, Yishay Mansour, and Steven Rudich.   Weakly 8 learning DNF and characterizing statistical query learn-ing using Fourier analysis.   1994.   In Proceedings of the 26 th Annual ACM Symposium on the Theory of Computing, 
cora	blum1994	 Avrim Blum, Merrick Furst, Jeffery Jackson, Michael Kearns, Yishay Mansour, and Steven Rudich.   Weakly learning DNF and characterizing statistical query learning using fourier analysis.   1994.   In Proceedings of the 26 th Annual ACM Symposium on the Theory of Computing, 
cora	blum1994	 Avrim Blum, Merrick Furst, Jeffery Jackson, Michael Kearns, Yishay Mansour, and Steven Rudich.   Weakly learning DNF and characterizing statistical query learning using fourier analysis.   1994.   In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, 
cora	blum1994	 A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich.   Weakly learning DNF and characterizing statistical query learning using fourier analysis.   1994.   In Proceedings of Twenty-sixth ACM Symposium on Theory of Computing, 
cora	blum1994	 A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich.   Weakly learning DNF and characterizing statistical query learning using fourier analysis.   1994.   In Proceedings of Twenty-sixth ACM Symposium on Theory of Computing, 
cora	blum1994	 Blum, A., M. Furst, J. Jackson, M. Kearns, Y. Mansour and S. Rudich,   Weakly Learning DNF and Characterizing Statistical Query Learning Using Fourier Analysis,   1994.   Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Helmbold, D. Haussler, R. Schapire, and M. K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., Haussler, D., Schapire, R. E., & Warmuth, M. K.   How to use expert advice.   (1993).   Proceedings of the Annual ACM Symposium on the Theory of Computing (pp. 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., Haussler, D., Schapire, R. E., & Warmuth, M. K.   How to use expert advice.   (1993).   Proceedings of the Annual ACM Symposium on the Theory of Computing (pp. 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., Haussler, D., Schapire, R. E., & Warmuth, M. K.   How to use expert advice.   (1993).   Proceedings of the Annual ACM Symposium on the Theory of Computing (pp. 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., Haussler, D., Schapire, R. E., & Warmuth, M. K.   How to use expert advice.   (1993).   Proceedings of the Annual ACM Symposium on the Theory of Computing (pp. 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., Haussler, D., Schapire, R. E., & Warmuth, M. K.   How to use expert advice.   (1993).   Proceedings of the Annual ACM Symposium on the Theory of Computing (pp. 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D., & Haussler, D.   How to use expert advice.   (1993).   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., and Warmuth, M.   How to use expert advice.   (1993).   In Proceedings of the Annual ACM Symp. on the Theory of Computing, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., and Warmuth, M.   How to use expert advice.   (1993).   In Proceedings of the Annual ACM Symp. on the Theory of Computing, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., and Warmuth, M.   How to use expert advice.   (1993).   In Proceedings of the Annual ACM Symp. on the Theory of Computing, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., and Warmuth, M.   How to use expert advice.   (1993).   In Proceedings of the Annual ACM Symp. on the Theory of Computing, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., and Warmuth, M.   How to use expert advice.   (1993).   In Proceedings of the Annual ACM Symp. on the Theory of Computing, 
cora	cesa	 Cesa-Bianchi, N., Y. Freund, D. P. Helmbold, D. Haus-sler, and R. E. Schapire a nd M. K. Warmuth.   How to use expert advice.   1995.  
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, M. K. War-muth.   How to use expert advice.   1993.   Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC). 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Haussler, D.P. Helmbold, R.E. Schapire, M. K. Warmuth.   How to use expert advice.   1993.   Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC). 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Haussler, D.P. Helmbold, R.E. Schapire, and M. K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haus-sler, R. E. Schapire, and M. K. Warmuth.   How to use expert advice.   1995.   In ACM Symp. on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haus-sler, R. E. Schapire, and M. K. Warmuth.   How to use expert advice.   1995.   In ACM Symp. on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Annual ACM Symposium on Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helm-bold, David Haussler, Robert E. Schapire, and Man-fred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Helmbold, D. Haussler, R. Schapire, and M. Warmuth.   How to use expert advice.    In Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haus-sler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haus-sler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haus-sler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Helmbold, D. Haussler, R. Schapire, and M.   War muth. How to use expert advice.   1993.   In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. E. Schapire, and M. K. Warmuth.   How to use expert advice.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. E. Schapire, and M. K. Warmuth.   How to use expert advice.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.H. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth,   How to use expert advice,    in 25th Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   Proceedings of the 25th ACM Symposium on the Theory of Computation, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helm-bold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   Proceedings of the 25th ACM Symposium on the Theory of Computation, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Helmbold, D. Haussler, R. Schapire, and M. War-muth.   How to use expert advice.   1993.   In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Helmbold, D. Haussler, R. Schapire, and M. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. E. Schapire, and M. K. Warmuth.   How to use expert advice.   1993.   In Proc. 25th Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the 43 Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the 43 Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth.   How to use expert advice.   1993.   Proceedings of the 25th ACM Symposium on the Theory of Computation, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E Schapire, and Manfred K Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E Schapire, and Manfred K Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E Schapire, and Manfred K Warmuth.   How to use expert advice.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. E. Schapire, and M. K.   Warmuth "How to use expert advice",   1993.   Proceedings of STOC93, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, and M. Warmuth.   On-line predic tion and conversion strategies.    In Computational Learning Theory: Eurocolt '93, volume New Series Number 53 of The Institute of Mathematics and its Applications Conference Series, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, and M. Warmuth.   On-line prediction and conversion strategies.    In Computational Learning Theory: Eurocolt '93, volume New Series Number 53 of The Institute of Mathematics and its Applications Conference Series, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, and M. Warmuth.   On-line prediction and conversion strategies.    In Computational Learning Theory: Eurocolt '93, volume New Series Number 53 of The Institute of Mathematics and its Applications Conference Series, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, and M. Warmuth.   On-line prediction and conversion strategies.    In Computational Learning Theory: Eurocolt '93, volume New Series Number 53 of The Institute of Mathematics and its Applications Conference Series, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold,   D.P., and Warmuth, </i> <publisher> M.K. </publisher> <date> (1994). </date> <i> On-line prediction and conversion strategies. In Proceedings of the First Euro-COLT Workshop.   (1994).   The Institute of Mathematics and its Applications, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., and Warmuth, M.   On-line prediction and conversion strategies.   (1994).   In Computational Learning Theory: 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., and Warmuth, M.   On-line prediction and conversion strategies.   (1994).   In Computational Learning Theory: 
cora	cesa	 Cesa-Bianchi, N., Y. Freund, D. P. Helmbold, and M. Warmuth.   On-line prediction and conversion strategies.   1994.   In Computational Learning Theory: Eurocolt '93, volume New Series Number 53 of The Institute of Mathematics and its Applications Conference Series, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, and M. Warmuth.   On-line prediction and conversion strategies.    In Computational Learning Theory: 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, and M. Warmuth.   On-line prediction and conversion strategies.    In Computational Learning Theory: 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, and M. Warmuth.   On-line prediction and conversion strategies.   1993.   In EuroCOLT, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, and M. Warmuth.   On-line prediction and conversion strategies.    In Computational Learning Theory: Eurocolt '93, volume New Series Number 53 of The Institute of Mathematics and its Applications Conference Series, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Helmbold, and M.K. Warmuth.   On-line prediction and conversion strategies.   1993.   The 1993 IMA European conference on Computational Learning Theory, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helm-bold, and M. Warmuth.   On-line prediction and conversion strategies.    In Computational Learning Theory: Eurocolt '93, volume New Series Number 53 of The Institute of Mathematics and its Applications Confer--ence Series, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E. & Warmuth, M. K.   How to use expert advice,   (1994),   Technical Report UCSC-CRL-94-33, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., and Warmuth, M. K.   "How to use expert advice,"   (1994),   Technical Report UCSC-CRL-94-33, </venue> <institution> University of California, </institution> <address> Santa Cruz, </address> <venue> Computer Research Laboratory. An extended abstract appeared in "Proceedings, 25th Annual ACM Symposium on the Theory of Computing," 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth,   "How to use expert advice",   1994.   Tech. Rep. 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. E. Schapire, and M. K. Warmuth.   How to use expert advice.   1994.   Technical Report UCSC-CRL-94-33, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth,   "How to use expert advice,"   1994.   Tech. Rep. 
cora	cesa	 N. Cesa-Bianchi, Y. Freund ,D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth.   How to use expert advice.   1994.   Technical Report UCSC-CRL-94-33, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. E. Schapire, and M. K. War-muth.   How to use expert advice.   1994.   Technical Report UCSC-CRL-94-33, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. E. Schapire, and M. K. Warmuth.   How to use expert advice.   1994.   Technical Report UCSC-CRL-94-33, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, and M. K. Warmuth,   "On-line prediction and conversion strategies,"   1996.   Machine Learning, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, and M. K. Warmuth.   On--line prediction and conversion strategies.   1995.   Machine Learning, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund,   D.P. Helmbold, and M.K. Warmuth. On-line prediction and conversion strategies.   1996.   Machine Learning, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund,   D.P. Helmbold, and M.K. Warmuth. On-line prediction and conversion strategies.   1996.   Machine Learning, 
cora	cesa	 Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K.   How to use expert advice.   (1997).   Journal of the ACM, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1997.   Journal of the Association for Computing Machinery, 
cora	cesa	 Nicolo Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, and Manfred K. Warmuth.   How to use expert advice.   1997.   Journal of the Association for Computing Machinery, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth,   "How to use expert advice,"   1997.   Journal of the ACM, 
cora	cesa	 N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth,   "How to use expert advice,"   1997.   Journal of the ACM, 
cora	cohen1998	 William W. Cohen, Rob Schapire, and Yoram Singer.   Learning to order things.   1997.  
cora	cohen1998	 William W. Cohen, Robert E. Schapire, and Yoram Singer.   Learning ro order things.   1997.   In Advances in Neural Information Processing Systems 10, 
cora	cohen1998	 William W. Cohen, Robert E. Schapire, and Yoram Singer.   Learning to order things.   1998.   In Advances in Neural Information Processing Systems 10, 
cora	cohen1998	 William W. Cohen, Robert E. Schapire, and Yoram Singer.   Learning to order things.   1998.   In Advances in Neural Information Processing Systems 10, 
cora	cohen1998	 W. W. Cohen, R. E. Shapire, and Y. Singer.   Learning to order things.   1998.   In Advances in Neural Information Processing Systems 10, 
cora	dietterich1996	 T. G. Dietterich, M. Kearns, and Y. Mansour.   Applying the weak learning framework to understand and improve C4.5.   1996.   In Proceedings of the 13th International Conference on Machine Learning, 
cora	dietterich1996	 Dietterich, T. G., Kearns, M., & Mansour, Y.   Applying the weak learning framework to understand and improve C4.5.   (1996).   In Proceedings of the 13th International Conference on Machine Learning, 
cora	dietterich1996	 Dietterich, T., Kearns, M., & Mansour, Y.   Applying the weak learning framework to understand and improve C4.5.   (1996).   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	dietterich1996	 Dietterich, T., Kearns, M., & Mansour, Y.   Applying the weak learning framework to understand and improve C4.5.   (1996).   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	dietterich1996	 Dietterich, T., Kearns, M., & Mansour, Y.   Applying the weak learning framework to understand and improve C4.5.   (1996).   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	dietterich1996	 Dietterich, T., Kearns, M., & Mansour, Y.   Applying the weak learning framework to understand and improve C4.5.   (1996).   Proc. Thirteenth Intl. Conf. Machine Learning (pp. 
cora	dietterich1996	 Dietterich, T., M. Kearns, and Y.   Mansour (1996). Applying the weak learning framework to un-derstand and improve C4.5.    To appear in Proceedings of the Thirteenth International Conference on Machine Learning. 
cora	dietterich1996	 Dietterich, T., M. Kearns, and Y.   Mansour (1996). Applying the weak learning framework to understand and improve C4.5.    To appear in Proceedings of the Thirteenth International Conference on Machine Learning. 
cora	dietterich1996	 T. Dietterich, M. Kearns, and Y. Mansour.   Applying the weak learning framework to understand and improve C4.5.   1996.   In Proceedings of the 13th International Conference on Machine Learning, 
cora	dietterich1996	 Tom Dietterich, Michael Kearns, and Yishay Mansour.   Applying the weak learning framework to understand and improve C4.5.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	dietterich1996	 T. Dietterich, M. Kearns, and Y. Mansour.   Applying the weak learning framework to understand and improve C4.5.   1996.   In Machine Learning: Proceedings of the International Conference. 
cora	dietterich1996	 T. Dietterich, M. Kearns, and Y. Mansour.   Applying the weak learning framework to understand and improve C4.5.   1996.   In Machine Learning: Proceedings of the International Conference. 
cora	dietterich1996	 T. Dietterich, M. Kearns, and Y. Mansour.   Applying the weak learning framework to understand and improve C4.5.   1996.   Unpublished manuscript, 
cora	drucker1992	 H. Drucker, R. Schapire, and P. Simard.   Improving performance in neural networks using a boosting algorithm.   1993.   Advances in Neural Information Processing Systems, 
cora	drucker1992	 H. Drucker, R. Schapire, and P. Simard.   Improving performance in neural networks using a boosting algorithm.   1993.   Advances in Neural Information Processing Systems, 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1992).   In Advances in neural information processing systems (Vol. 4). 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1992).   In Advances in neural information processing systems (Vol. 4). 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1992).   In Advances in neural information processing systems (Vol. 4). 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1992).   In Advances in neural information processing systems (Vol. 4). 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1992).   Advances in Neural Information Processing Systems (volume 5), 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1992).   Advances in Neural Information Processing Systems (volume 5), 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1992).   Advances in Neural Information Processing Systems (volume 5), 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1992).   Advances in Neural Information Processing Systems (volume 5), 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1993).   Advances in Neural Information Processing Systems (volume 5). 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1993).   Advances in Neural Information Processing Systems (volume 5). 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1993).   Advances in Neural Information Processing Systems (volume 5). 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P.   Improving the performance in neural networks using a boosting algorithm.   (1993).   Advances in Neural Information Processing Systems, 
cora	drucker1992	 Drucker, H., Schapire, R., & Simard, P. </author> <date> (1993b). </date> <i> Improving performance in neural networks using a boosting algorithm. </i> <editor> In Hanson, S. J., Cowan, J. D., & Giles, C. L. (Eds.), </editor> <venue> Advances in Neural Information Processing Systems, </venue> <volume> volume 5, </volume> <pages> (pp. 42-49). </pages> <note> Morgan Kaufmann. 198 Duda, </note> <author> R. & Hart, P.   Improving performance in neural networks using a boosting algorithm. </i> <editor> In Hanson, S. J., Cowan, J. D., & Giles, C. L. (Eds.), </editor> <venue> Advances in Neural Information Processing Systems, </venue> <volume> volume 5, </volume> <pages> (pp. 42-49). </pages> <note> Morgan Kaufmann. 198 Duda, </note> <author> R. & Hart, P. </author> <date> (1973). </date> <i> Pattern Classification and Scene Analysis.   (1993b). </date> <i> Improving performance in neural networks using a boosting algorithm. </i> <editor> In Hanson, S. J., Cowan, J. D., & Giles, C. L. (Eds.), </editor> <venue> Advances in Neural Information Processing Systems, </venue> <volume> volume 5, </volume> <pages> (pp. 42-49). </pages> <note> Morgan Kaufmann. 198 Duda, </note> <author> R. & Hart, P. </author> <date> (1973).   Advances in Neural Information Processing Systems, 
cora	drucker1992	 Drucker, H., Schapire, R., and Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1993).   Advances in Neural Information Processing Systems, 
cora	drucker1992	 Drucker, H., Schapire, R., and Simard, P.   Improving performance in neural networks using a boosting algorithm.   (1993).   Advances in Neural Information Processing Systems, 
cora	drucker1992	 Drucker, H., Schapire, R., and Simard, R.   Improving performance in neural networks using a boosting algorithm.   1993.   Advances in Neural Information Processing Systems 5, 
cora	drucker1992	 Drucker, Harris; Schapire, Robert; and Simard,   Patrice 1993. Improving performance in neural networks using a boosting algorithm.    In Advances in Neural Informations Processing Systems 5, 
cora	drucker1992	 Drucker, H., Schapire, R., Simard, P.   (1993) "Improving Performance in Neural Networks Using a Boosting Algorithm,"    in Advances in Neural Information Processing Systems 5, 
cora	drucker1992	 Drucker, Schapire and Simard,   Improving performance in neural networks using a boosting algorithm,   1993,   Advances in Neural Information Processing Systems 5, 
cora	drucker1992	 Harris Drucker, Robert Schapire, and Patrice Simard.   Improving performance in neural networks using a boosting algorithm.   1993.   Advances in Neural Information Processing Systems 5, 
cora	drucker1992	 Harris Drucker, Robert Schapire, and Patrice Simard.   Improving performance in neural networks using a boosting algorithm.   1992.   In Advances in Neural Information Processing Systems. 
cora	drucker1992	 H. Drucker, R. Schapire, and P. Simard,   "Improving performance in neural networks using a boosting algorithm,"   1993,   in Advances in Neural Information Processing Systems 5, 
cora	drucker1992	 Drucker, H., Schapire, R., Simard, P.   (1993) "Improving Performance in Neural Networks Using a Boosting Algorithm,"    in Advances in Neural Information Processing Systems 5, 
cora	drucker1992	 Drucker, H., Schapire, R., Simard, P.   (1993) "Improving Performance in Neural Networks Using a Boosting Algorithm,"    in Advances in Neural Information Processing Systems 5, 
cora	drucker1992	 Drucker, H., Schapire, R., Simard, P.   (1993) "Improving Performance in Neural Networks Using a Boosting Algorithm,"    in Advances in Neural Information Processing Systems 5, 
cora	drucker1992	 Harris Drucker, Robert Schapire, and Patrice Simard.   Improving performance in neural networks using a boosting algorithm.   1993.   In Advances in Neural Information Processing Systems 5, 
cora	drucker1992	 Harris Drucker, Robert Schapire, and Patrice Simard.   Improving performance in neural networks using a boosting algorithm.    In Advances in Neural Informations Processing Systems 5, 
cora	drucker1992	 Harris Drucker, Robert E. Schapire, and Ptrice Simard.   Improving performance in neural networks using a boosting algorithm.    In Proceedings of the fifth Conf. on Neural Informations Processing Systems, 
cora	drucker1993	 H. Drucker, R. Schapire, and P. Simard.   Boosting performance in neural networks.    International Journal of Pattern Recognition and Artificial Intelligence, 
cora	drucker1993	 Harris Drucker, Robert Schapire, and Patrice Simard.   Boosting performance in neural net-works.   1993.   International Journal of Pattern Recognition and Artificial Intelligence, 
cora	drucker1993	 Harris Drucker, Robert Schapire, and Patrice Simard.   Boosting performance in neural networks.   1993.   International Journal of Pattern Recognition and Artificial Intelligence, 
cora	drucker1993	 Drucker, H., R. Schapire & P.   Improving the performance in neural networks using a boosting algorithm,   (1993),   Advances in Neural Information Processing Systems, 
cora	drucker1993	 Drucker, H., Schapire, R. & Simard, P.   Improving Performance in Neural Networks Using a Boosting Algorithm,   (1993),   `Neural Information Processing Systems', 
cora	drucker1993	 Drucker, H., Schapire, R. E., & Simard, P.   Boosting performance in neural networks.   (1993).   International Journal of Pattern Recognition and Artificial Intelligence, 
cora	drucker1993	 Drucker, H., Schapire, R., & Simard, P.   Boosting performance in neural networks.   (1993).   Intl. J. Pat. Recog. Art. Intel., 
cora	drucker1993	 Drucker, H., Schapire, R., & Simard, P.   Boosting performance in neural networks.   (1993a).   International Journal of Pattern Recognition and Artificial Intelligence, 
cora	drucker1993	 Drucker, Harris; Schapire, Robert; and Simard,   Patrice up . Boosting performance in neural networks.    International Journal of Pattern Recognition and Artificial Intelligence 7(4) 
cora	drucker1993	 H. Drucker, R. Schapire, and P. Simard.   Boosting performance in neural networks.   1993.   International Journal of Pattern Recognition and Artificial Intelligence, 
cora	drucker1993	 Harris Drucker, Robert Schapire, and Patrice Simard.   Boosting performance in neural networks.   1993.   International Journal of Pattern Recognition and Artificial Intelligence, 
cora	drucker1993	 H. Drucker, R. Schapire, and P. Simard,   "Boosting Performance in Neural Networks,"   1993.   International Journal of Pattern Recognition and Artificial Intelligence, 
cora	drucker1993	 Harris Drucker, Robert Schapire, and Patrice Simard.   Boosting performance in neural networks.   1993.   International Journal of Pattern Recognition and Artificial Intelligence, 
cora	drucker1993	 Harris Drucker, Robert Schapire, and Patrice Simard.   Boosting performance in neural networks.   1993.   International Journal of Pattern Recognition and Artificial Intelligence, 
cora	drucker1993	 H. Drucker, R. Schapire, and P. Simard.   Boosting performance in neural networks.   1993.   Intl. J. Pat. Recog. Art. Intel., 
cora	drucker1993	 H. Drucker, R. Schapire, and P. Simard.   Boosting performance in neural networks.   1993.   Intl. J. Pat. Recog. Art. Intel., 
cora	drucker1993	 Harris Drucker, Robert Schapire, and Patrice Simard.   Boosting performance in neural networks.   1993.   International Journal of Pattern Recognition and Artificial Intelligence, 
cora	druker1992	 H. Druker, R. Schapire, P. Simard,   Improving performance in neural networks using a boosting algorithm,   1993,   Advances in Neural Information Processing Systems, 
cora	ehrenfeucht1988	 Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L.   A general lower bound on the number of examples needed for learning.   (1988).   In Proceedings COLT-88. 
cora	ehrenfeucht1988	 Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L.   A general lower bound on the number of examples needed for learning.   (1988).   In Proceedings COLT-88. 
cora	ehrenfeucht1988	 Ehrenfeucht, A.; Haussler, D.; Kearns, M.; and Valiant, L.G.   A General Lower Bound on the Number of Examples Needed for Learning.   1988.   In Proceedings of the First Workshop on Computational Learning Theory, 
cora	ehrenfeucht1988	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1988.   Technical Report UCSC-CRL-87-26, 
cora	ehrenfeucht1988	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.    In COLT 88: Proceedings of the Conference on Learning, 
cora	ehrenfeucht1988	 A. Ehrenfeucht, D. Haussler, M. Kearns and L. G. Valiant,   A General Lower Bound on the Number of Examples Needed for Learning,   1988)   in: Proceedings of the First Workshop on Computational Learning Theory (Morgan Kaufmann, 
cora	ehrenfeucht1988	 Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L.,   A General Lower Bound on the Number of Examples Needed for Learning,   1988,   Proceedings of the 1988 Workshop on Computational Learning Theory, 
cora	ehrenfeucht1988	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.    Proc. of the 1988 Workshop on Computational Learning Theory, 
cora	ehrenfeucht1988	 A. Ehrenfeucht, D. Haussler, M. Kearns. L.G. Valiant.   A general lower bound on the number of examples needed for learning.   1988,   33 Proceedings of the 1988 Workshop on Computational Learning Theory, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Inf. and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant,   A general lower bound on the number of examples needed for learning.   (1989).   Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns M., & Valiant, L.G.   A general lower bound on the number of examples needed for learning.   (1989).   Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M. J., and Valiant, L.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M. J., and Valiant, L.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M. J., and Valiant, L.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L. G.   A General Lower Bound on the Number of Examples Needed for Learning.   (1989).   Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L.G.   A General Lower Bound on the Number of Examples Needed for Learning.   (1989).   Information and Computation 82, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L.   A general lower bound on the number of examples needed for learning.   (1989).   Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L.   A general lower bound on the number of examples needed for learning.   (1989).   Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L.   A general lower bound on the number of examples needed for learning.   (1989).   Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L.   A general lower bound on the number of examples needed for learning.   (1989).   Information and Control 82, 
cora	ehrenfeucht1989	 Ehrenfeucht, Andrzej; Haussler, David; Kearns, Michael; and Valiant,   Leslie 1989. A general lower bound on the number of examples needed for learning.    Information and Computation 82 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning,    Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant.   A general lower bound on the number of examples needed for learning. Information and Computation,   1989.  
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant.   A general lower bound on the number of examples needed for learning. Information and Computation,   1989.  
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L.   A general lower bound on the number of examples needed for learning.    Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L.   A general lower bound on the number of examples needed for learning.    Information and Computation, 
cora	ehrenfeucht1989	 Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L.   A general lower bound on the number of examples needed for learning.    Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns. L.G. Valiant.   A general lower bound on the number of examples needed for learning.   1989,   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Control, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. J. Kearns and L. G. Valiant.   A General Lower Bound on the Number of Examples Needed for Learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. J. Kearns and L. G. Valiant.   A General Lower Bound on the Number of Examples Needed for Learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. J. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning. Information and Computation,   1989.  
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns. L.G. Valiant.   A general lower bound on the number of examples needed for learning.   1989,   Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant.   A general lower bound on the number of examples needed for learning.   1989.   Information and Computation, 
cora	ehrenfeucht1989	 A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant.   A general lower bound on the number of examples needed for learning. Information and Computation,   1989.  
cora	feder1995	 M. Feder, Y. Freund, and Y. Mansour.   Optimal universal learning and prediction of probabilistic concepts.   1995.   In Proc. of IEEE Information Theory Conference, 
cora	feder1995	 M. Feder, Y. Freund, and Y. Mansour.   Optimal universal learning and prediction of probabilistic concepts.   1995.   In Proc. of IEEE Information Theory Conference, 
cora	feder1995	 M. Feder, Yoav Freund and Yishay Mansour,   Optimal Universal Learning and Prediction of Probabilistic Concepts,   
cora	feder1995	 M. Feder, Y. Freund, and Y. Mansour.   Optimal universal learning and prediction of probabilistic concepts.   1995.   In Proc. of IEEE Information Theory Conference, 
cora	freund0000a	 Yoav Freund and Robert E. Schapire.   Adaptive game playing using multiplicative weights. Games and Economic Behavior,   
cora	freund0000a	 Yoav Freund and Robert E. Schapire.   Adaptive game playing using multiplicative weights. Games and Economic Behavior,   
cora	freund1990	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority,   (1990),   in "Proceedings of the Third Annual Workshop on Computational Learning Theory", 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority,   (1990),   in "Proceedings of the Third Annual Workshop on Computational Learning Theory", 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority,   (1990),   in Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority,   (1990),   in Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority,   (1990),   in Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority,   (1990),   in Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority,   (1990),   in Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority,   (1990),   in `Proceedings of the Third Annual Workshop on Computational Learning Theory', 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority,   (1990),   in `Proceedings of the Third Annual Workshop on Computational Learning Theory', 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   In 3rd annual workshop on computational learning theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   In 3rd annual workshop on computational learning theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   In Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   In Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   In Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   Proc. 3rd Work. Comp. Learning Theory (pp. 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   Proc. 3rd Work. Comp. Learning Theory (pp. 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   Proceedings of the Third Annual Workshop on Computational Learning Theory (pp. 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   Proceedings of the Third Annual Workshop on Computational Learning Theory (pp. 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   Proceedings of the Third Annual Workshop on Computational Learning Theory (pp. 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   Proceedings of the Third Annual Workshop on Computational Learning Theory (pp. 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1990).   Proceedings of the Third Annual Workshop on Computational Learning Theory (pp. 
cora	freund1990	 Freund, Y.   Boosting a weak learning algorithm by majority.   1990.   In Proceedings of the Third Workshop on Computational Learning Theory, 
cora	freund1990	 Y. Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proc. 3rd Work. Comp. Learning Theory, 
cora	freund1990	 Y. Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proc. 3rd Work. Comp. Learning Theory, 
cora	freund1990	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proc. of the 3rd Ann. Workshop on Comput. Learning Theory, 
cora	freund1990	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proc. of the 3rd Ann. Workshop on Comput. Learning Theory, 
cora	freund1990	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proc. of the 3rd Ann. Workshop on Comput. Learning Theory, 
cora	freund1990	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proc. of the 3rd Ann. Workshop on Comput. Learning Theory, 
cora	freund1990	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Y. Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proc. 3rd Work. Comp. Learning Theory, 
cora	freund1990	 Y. Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proc. 3rd Work. Comp. Learning Theory, 
cora	freund1990	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Freund, Y.,   Boosting a weak learning algorithm by majority,   1990.   Proceedings of the 1990 Workshop on Computational Learning Theory, p. 
cora	freund1990	 Freund, Y.,   Boosting a Weak Learning Algorithm by Majority Voting,   1990.   Proceedings of the 3rd Annual Workshop on Computational Learning Theory, 
cora	freund1990	 Y. Freund.   Boosting a weak learning algorithm by majority.   1990.   In Proceedings of the 1990 Workshop on Computational Learning Theory, 
cora	freund1990	 Y. Freund.   Boosting a weak learning algorithm by majority.    In Proceedings of the Third Workshop on Computational Learning Theory, 
cora	freund1992a	 Y. Freund, H. S. Seung, E. Shamir, and N. Tishby.   Information, prediction, and query by committee.    In Advances in Neural Informations Processing Systems 5, 
cora	freund1992a	 Y. Freund, H. S. Seung, E. Shamir, and N. Tishby.   Information, prediction, and query by committee.    In Advances in Neural Informations Processing Systems 5, 
cora	freund1992a	 Yoav Freund, H. Sebastian Seung, Eli Shamir, and Naftali Tishby.   Information, prediction, and query by committee.   1993.   Advances in Neural Information Processing Systems, 
cora	freund1992a	 Freund Y., Seung H.S., Shamir E. and Tishby N.   Information, prediction, and query by committee.   (1995).   preprint. 
cora	freund1992a	 Freund, Y., Seung, H. S., Shamir, E., & Tishby, N.   Information, prediction, and query by committee.   (1993).   Advances in Neural Information Processing Systems, 
cora	freund1992a	 Freund, Y., Seung, H., Shamir, E. & Tishby, N.   Information, prediction, and query by committee,   (1993),   in `Advances in Neural Information Processing Systems', 
cora	freund1992a	 Freund, Y., Seung, H., Shamir, E., and Tishby, N.   Information, prediction and query by comittee.   (1993).   Advances in Neural Information Processing Systems, 
cora	freund1992a	 Freund, Y.; Seung, H.S.; Shamir, E.; and Tishby, N.   Information, prediction, and query by committee.   1992.   In Advances in Neural Informations Processing Systems 5, 
cora	freund1992a	 Y. Freund, H. S. Seung, E. Shamir and N. Tishby.   (1993) Information, prediction, and query by committee.   
cora	freund1992a	 Y. Freund, H. S. Seung, E. Shamir and N. Tishby.   (1993) Information, prediction, and query by committee.   
cora	freund1992a	 Y. Freund, H. S. Seung, E. Shamir and N. Tishby.   (1993) Information, prediction, and query by committee.    Advances in Neural Information Processing Systems 5, 
cora	freund1992a	 Y. Freund, H. S. Seung, E. Shamir and N. Tishby.   (1993) Information, prediction, and query by committee.    Advances in Neural Information Processing Systems 5, 
cora	freund1992a	 Y. Freund, H.S. Seung, E. Shamir, and N. Tishby.   Information, prediction, and query by committee.    In Advances in Neural Informations Processing Systems 5, 
cora	freund1992a	 Y. Freund, H.S. Seung, E. Shamir, and N. Tishby.   Information, prediction, and query by committee.    In Advances in Neural Informations Processing Systems 5, 
cora	freund1992a	 Y. Freund, H. S. Seung, E. Shamir, and N. Tishby.   Information, prediction, and query by committee.    In Advances in Neural Information Processing Systems 5, 
cora	freund1992a	 Y. Freund, H.S. Seung, E Shamir, and N. Tishby.   Information, prediction, and query by committee.   1993.   Advances in Neural Information Processing Systems, 
cora	freund1992a	 Y. Freund, H.S. Seung, E. Shamir, and N. Tishby.   Information, prediction, and query by committee.   1993.   In Advances in Neural Information Processing Systems, 
cora	freund1992a	 Y. Freund, H.S. Seung, E. Shamir, and N. Tishby.   Information, prediction, and query by committee.   1993.   In Advances in Neural Information Processing Systems, 
cora	freund1992a	 Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby,   Information, Prediction, and Query by Committee,    NIPS92, p. 
cora	freund1992a	 Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby,   Information, Prediction, and Query by Committee,    NIPS92, p. 
cora	freund1992a	 Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby,   Information, Prediction, and Query by Committee,    NIPS92, p. 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   In Proc. 5th Annu. Workshop on Comput. Learning Theory, 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   In Proc. 5th Annu. Workshop on Comput. Learning Theory, 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   Proc. 5th Work. Comp. Learning Theory (pp. 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   (1992).   Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 
cora	freund1992b	 Freund, Y.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Workshop on Computational Learning Theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proc. of the 5th Ann. Workshop on Comput. Learning Theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proc. of the 5th Ann. Workshop on Comput. Learning Theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proc. of the 5th Ann. Workshop on Comput. Learning Theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proc. of the 5th Ann. Workshop on Comput. Learning Theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the 5th Workshop on Computational Learning theory, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Y. Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of COLT '92, 
cora	freund1992b	 Yoav Freund.   An improved boosting algorithm and its implications on learning complex-ity.   1992.   In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, 
cora	freund1992b	 Freund, Y.,   An Improved Boosting Algorithm and its Implications on Learning Complexity,   1992.   Proceedings of the 5rd Annual Workshop on Computational Learning Theory, 
cora	freund1992b	 Y. Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Y. Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Y. Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Y. Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Y. Freund.   An improved boosting algorithm and its implications on learning complexity.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	freund1992b	 Y. Freund.   An improved boosting algorithm and its implications on learning complexity.    In Proceedings of the Fifth Workshop on Computational Learning Theory, 
cora	freund1992c	 Freund, Y. and Haussler, D.   Unsupervised Learning of Distributions on Binary Vectors using Two Layer Networks,   (1992),   In Advances in Neural Information Processing Systems IV (Denver 1992), 
cora	freund1992c	 Y. Freund and D. Haussler.   Unsupervised learning of distributions on binary vectors using two layer networks.   1992.   In Proceedings of the 1991 Conference on Neural Information Processing Systems. 
cora	freund1992c	 Freund, Y & Haussler,   D (1992). Unsupervised learning of distributions on binary vectors using two layer networks.    Advances in Neural Information Processing Systems 4, 
cora	freund1992c	 Y. Freund and D. Haussler.   Unsupervised learning of distributions on binary vectors using 2-layer networks.   1992.   In Advances In Neural Information Processing Systems 4, 
cora	freund1992c	 Y. Freund and D. Haussler.   Unsupervised learning of distributions on binary vectors using 2-layer networks.   1992.   In Advances In Neural Information Processing Systems 4, 
cora	freund1992c	 Freund, Y., and Haussler, D.   Unsupervised learning of distributions on binary vectors using two layer networks.   1992,   In Neural Information Processing Systems 4, 
cora	freund1992c	 Freund, Y., and Haussler, D.,   Unsupervised learning of distributions on binary vectors using two layer networks. Pp.   1992.   912919 in Neural Information Processing Systems 4, edited by J.Moody, S.J.Hanson and R.P.Lippmann. 
cora	freund1992c	 Y. Freund and D. Haussler.   Unsupevised learning of distributions on binary vectors using two-layer networks.    In Proceedings of the 1991 Conf. on Neural Informations Processing Systems, 
cora	freund1993a	 Y. Freund, M. J. Kearns, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   (1993).   Proceedings of the 25th Annual ACM Symposium on Theory of Computing (pp. 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R.E. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 
cora	freund1993a	 Yoav Freund, Michael Kearns, Dana Ron, Ronitt Rubinfeld, Robert Schapire, and Linda Sellie.   Efficient Learning of Typical Finite Automata from Random Walks,    STOC-93, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R.E. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. Schapire, L. Sellie.   Efficient Learning of Typical Finite Automata from Random Walks.   1993.   Proc. 25 th Annual ACM Symposium on the Theory of Computing, 
cora	freund1993a	 Yoav Freund, Michael Kearns, Dana Ron, Ronitt Rubinfeld, Robert Schapire, and Linda Sellie.   Efficient Learning of Typical Finite Automata from Random Walks,    STOC-93, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 
cora	freund1993a	 Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, and Linda Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R.E. Schapire, and L. Sellie,   Efficient Learning of Typical Finite Automata from Random Walks,   
cora	freund1993a	 Yoav Freund, Michael Kearns, Dana Ron, Ronitt Rubinfeld, Robert Schapire, and Linda Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	freund1993a	 Yoav Freund, Michael Kearns, Dana Ron, Ronitt Rubenfeld, Robert Schapire, and Linda Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	freund1993a	 Y. Freund, M. J. Kearns, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.    13 In Proceedings of the 25th Annual ACM Symposium on Theory of Com--puting, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R.E. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 24th Annual ACM Symp. on Theory of Computing, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 24th Annual ACM Symp. on Theory of Computing, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R.E. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 24th Annual ACM Symp. on Theory of Computing, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie.   Efficient Learning of Typical Finite Automata from Random Walks.   1993.   In Proc. 25th STOC, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie.   Efficient Learning of Typical Finite Automata from Random Walks.   1993.   In Proc. 25th STOC, 
cora	freund1993a	 Yoav Freund, Michael Kearns, Dana Ron, Ronitt Rubinfeld, Robert Schapire, and Linda Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 
cora	freund1993a	 Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   Efficient learning of typical finite automata from random walks.   1993.   In ACM Symposium on the Theory of Computing, 
cora	freund1993a	 Freund, Y.; Kearns, M. J.; Ron, D.; Rubinfeld, R.; Schapire, R. E.; and Sellie, L.   Efficient learning of typical finite automata from random walks.   1993.   In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 
cora	freund1993b	 Yoav Freund.   Data Filtering and Distribution Modeling Algorithms for Machine Learning.   1993.   PhD thesis, 
cora	freund1993b	 Yoav Freund.   Data Filtering and Distribution Modeling Algorithms for Machine Learning.   1993.   PhD thesis, 
cora	freund1993b	 Freund, Y.   Data Filtering and Distribution Modeling Algorithms for Machine Learning.   (1993).   PhD thesis, 
cora	freund1993b	 Freund, Y.   Data Filtering and Distribution Modeling Algorithms for Machine Learning.   (1993).   PhD thesis, 
cora	freund1993b	 Freund, Y.   Data Filtering and Distribution Modeling Algorithms for Machine Learning.   (1993).   PhD thesis, 
cora	freund1993b	 Freund, Y.   Data Filtering and Distribution Modeling Algorithms for Machine Learning.   (1993).   PhD thesis, 
cora	freund1993b	 Yoav Freund.   Data Filtering and Distribution Modeling Algorithms for Machine Learning.   1993.   PhD thesis, 
cora	freund1993c	 Yoav Freund, H. Sebastian Seung, Eli Shamir, and Naftali Tishby.   Selective sampling using the query by committee algorithm.    In Advances in Neural Information Processing Systems, 
cora	freund1993c	 Y. Freund, H.S Seung, E. Shamir, and N. Tishby.   Accelerating learning using query by committee.    In Proceedings of the 1992 Conf. on Neural Informations Processing Systems (To appear), 
cora	freund1995a	 Y. Freund.   Boosting a weak learning algorithm by majority.   1995.   Information and Computation, 
cora	freund1995a	 Y. Freund.   Boosting a weak learning algorithm by majority.   1995.   Information and Computation, 
cora	freund1995a	 Yoav Freund.   Boosting a weak learning algorithm by majority.    Information and Computation, 
cora	freund1995a	 Yoav Freund.   Boosting a weak learning algorithm by majority.    Information and Computation, 
cora	freund1995a	 Freund, Y.   `Boosting a weak learning algorithm by majority',   (1995),   Information and Computation 121(2), 
cora	freund1995a	 Freund, Y.   Boosting a weak learning algorithm by majority.   (1995).   Information and Computation, 
cora	freund1995a	 Freund, Y.   `Boosting a weak learning algorithm by majority',   (1996),   Information and Computation 121(2), 
cora	freund1995a	 Freund, Y.   `Boosting a weak learning algorithm by majority',   (1996),   Information and Computation 121(2), 
cora	freund1995a	 Freund, Y.   Boosting a Weak Learning Algorithm by Majority.   1996.   Information and Computation 121(2): 
cora	freund1995a	 Freund, Y.   Boosting a Weak Learning Algorithm by Majority.   1996.   Information and Computation 121(2): 
cora	freund1995a	 Freund, Y.:   Boosting a weak learning algorithm by majority.   
cora	freund1995a	 Freund, Y.:   Boosting a weak learning algorithm by majority.   
cora	freund1995a	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1990.   Information and Computation, 
cora	freund1995a	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1995.   Information and Computation, 
cora	freund1995a	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1995.   Information and Computation, 
cora	freund1995a	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1995.   Information and Computation, 
cora	freund1995a	 Yoav Freund.   Boosting a weak learning algorithm by major ity.   1995.   Information and Computation, 
cora	freund1995a	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1995.   Information and Computation, 
cora	freund1995a	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1995.   Information and Computation, 
cora	freund1995a	 Yoav Freund.   Boosting a weak learning algorithm by majority.   1995.   Information and Computation, 
cora	freund1995a	 Freund, Y.   Boosting a Weak Learning Algorithm by Majority.    Information and Computation 121(2): 
cora	freund1995b	 Y. Freund and R. E. Schapire.   A decision-theoretic generalization of on-line learning and an applicationto boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Y. Freund and R. E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Computational Learning Theory: Second European Conference, 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting,   (1995),   in "Proceedings of the Second European Conference on Computational Learning Theory", 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting,   (1995),   in "Proceedings of the Second European Conference on Computational Learning Theory", 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting,   (1995),   in Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting,   (1995),   in Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting,   (1995),   in Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting,   (1995),   in Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting,   (1995),   in Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting,   (1995),   in `Proceedings of the Second European Conference on Computational Learning Theory', 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting,   (1995),   in `Proceedings of the Second European Conference on Computational Learning Theory', 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting,   (1995),   in `Proceedings of the Second European Conference on Computational Learning Theory', 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   In Proc. of the 2nd Annual European Conf. on Computational Learning Theory. 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and its application to boosting.   (1995).   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and its application to boosting.   (1995).   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and its application to boosting.   (1995).   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Freund, Y. & Shapire, R.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   In Proceedings of the Second European Conference on Computational Learning. 
cora	freund1995b	 Freund, Y. and Schapire, R.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   In 2nd European Conference on Computational Learning Theory. 
cora	freund1995b	 Freund, Y. and Schapire, R.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   In 2nd European Conference on Computational Learning Theory. 
cora	freund1995b	 Freund, Y. and Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   In Computational Learning Theory: 
cora	freund1995b	 Freund, Y. and Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   In Computational Learning Theory: 
cora	freund1995b	 Freund, Y. and Schapire, R.E.   A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory. 
cora	freund1995b	 Freund, Y. and Schapire, R.E.   A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory. 
cora	freund1995b	 Freund, Y., & Schapire, R. E.   A decisiontheoretic generalization of on-line learning and an application to boosting.   (1995).   In Proceedings ECML-95 San Francisco, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decisiontheoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic gen eralization of on-line learning and an application to boosting.   1995.   In Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Schapire, R.E., and Y. Freund,   "A decision theoretic generalization of on-line learning and its application to boosting".   1995.   In EuroColt '95,pp. 
cora	freund1995b	 Schapire, R.E., and Y. Freund,   "A decision theoretic generalization of on-line learning and its application to boosting".   1995.   In EuroColt '95,pp. 
cora	freund1995b	 Y. Freund and R.E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In EuroColt-95, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Computational Learning Theory: Second European Conference, 
cora	freund1995b	 Freund, Y., and Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.    In Proceedings of the Second European Conference on Computational Learning Theory (Mar. 1995), 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of online learning and an application to boosting.   1995.   In Computational Learning Theory: 7 Second European Conference, 
cora	freund1995b	 Y. Freund and R. Schapire.   A decision-theoretic gener alization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Y. Freund and R. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Y. Freund and R. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Y. Freund and R. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Y. Freund and R. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Y. Freund and R. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In Proceedings of the Second European Conference on Computational Learning Theory, 
cora	freund1995b	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   In eurocolt95, 
cora	freund1995c	 Freund, Y. & Schapire, R.E.   A Decision-Theoretic Generalization of On-Line Learning and an application to Boosting.   (1995.)   Lecture Notes in Artificial Intelligence, 
cora	freund1995d	 Freund, Y., & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   Tech. rep., 
cora	freund1995d	 Freund, Y., & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   Tech. rep., 
cora	freund1995d	 Freund, Y., & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   Tech. rep., 
cora	freund1995d	 Freund, Y., & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1995).   Tech. rep., 
cora	freund1995e	 Y. Freund and D. Ron.   Learning to model sequences generated by switching distributions.   1995.   Proceedings of the 1995 Conference on Computational Learning Theory, 
cora	freund1995e	 Y. Freund, D. Ron.   Learning to Model Sequences Generated by Switching Distributions.   1995.  
cora	freund1995e	 Y. Freund, D. Ron.   Learning to Model Sequences Generated by Switching Distributions.   1995.  
cora	freund1995e	 Y. Freund, D. Ron.   Learning to Model Sequences Generated by Switching Distributions.   1995.  
cora	freund1995e	 Y. Freund and D. Ron.   Learning to model sequences generated by switching distributions.   1995.   In Proceedings of the Eighth Annual ACM Conference on Computational Learning Theory (COLT), 
cora	freund1995e	 Y. Freund and D. Ron.   Learning to model sequences generated by switching distributions.   1995.   In Proceedings of the Eighth Annual ACM Conference on Computational Learning Theory (COLT), 
cora	freund1995e	 Y. Freund and D. Ron.   Learning to model sequences generated by switching distributions.   1995.   In Proceedings of the Eighth Annual ACM Conference on Computational Learning Theory (COLT), 
cora	freund1995f	 Freud, Y., Kearns, M., Mansour, Y. Ron, D., Rubinfeld, R., and Shapire, R. E.   Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries.   1995.   Proceedings of the 36 th Annual Symposium on Foundations of Computer Science. 
cora	freund1995f	 Y. Freund, M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, and R. Schapire.   Efficient algorithms for learning to play repeated games against computationally bounded adversaries.   1995.   To appear in Proceedings of the Thirty Sixth Annual Symposium on Foundations of Computer Science, 
cora	freund1995f	 Yoav Freund, Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, and Robert E. Schapire.   Efficient algorithms for learning to play repeated games against computationally bounded adversaries.   1995.   To appear in Proceedings of the Thirty Sixth Annual Symposium on Foundations of Computer Science, 
cora	freund1995f	 Y. Freund, M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, and R. Schapire.   Efficient algorithms for learning to play repeated games against computationally bounded adversaries.   1996.   In Proceedings of the Thirty Seventh Annual Symposium on Foundations of Computer Science, 
cora	freund1995f	 Y. Freund, M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, and R. E. Schapire.   Efficient algorithms for learning to play repeated games against computationally bounded adversaries.   1995.   In Proceedings of the Thirty Sixth Annual Symposium on Foundations of Computer Science, 
cora	freund1995f	 Freund, Y., M. Kearns et al.   (1995) Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries.    FOCS 36. 
cora	freund1995f	 Freund, Y., M. Kearns et al.   (1995) Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries.    FOCS 36. 
cora	freund1995f	 Y. Freund, M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, and R. E. Schapire.   Efficient algorithms for learning to play repeated games against computationally bounded adversaries.   1995.   In IEEE Symposium on the Foundations of Computer Science, 
cora	freund1996a	 Y. Freund.   Predicting a binary sequence almost as well as the optimal biased coin.   1996.   In Proceedings of the 9th Annual Conference on Computational Learning Theory, 
cora	freund1996a	 Y. Freund.   Predicting a binary sequence almost as well as the optimal biased coin.   1996.   In Proceedings of the 9th Annual Conference on Computational Learning Theory, 
cora	freund1996a	 Y. Freund.   Predicting a binary sequence almost as well as the optimal biased coin.   1996.   In Proceedings of the 9th Annual Conference on Computational Learning Theory, 
cora	freund1996a	 Y. Freund.   Predicting a binary sequence almost as well as the optimal biased coin.   1996.   In Proceedings of the 9th Annual Conference on Computational Learning Theory, 
cora	freund1996a	 Y. Freund,   "Predicting bits almost as well as the optimal biased coin,"   1996,   in Proc. 9th Annual Conference on Computational Learning Theory, 
cora	freund1996a	 Y. Freund,   Predicting a binary sequence as well as the optimal biased coin,   (1996).   Proceedings of the ninth annual conference on computational learning theory, 
cora	freund1996a	 Yoav Freund.   Predicting a binary sequence almost as well as the optimal biased coin.   1996.   In Proceedings of the Ninth Annual Conference on Computational Learning Theory, 
cora	freund1996b	 Y. Freund and R. Schapire.   Game theory, on-line prediction and boosting.   1996.   In Pro ceedings of the 9th Annual Conference on Computational Learning Theory, 
cora	freund1996b	 Y. Freund and R. Schapire.   Game theory, on-line prediction and boosting.   1996.   In Proceedings of the 9th Annual Conference on Computational Learning Theory, 
cora	freund1996b	 Y. Freund and R. Schapire.   Game theory, on-line prediction and boosting.   1996.   In Proceedings of the 9th Annual Conference on Computational Learning Theory, 
cora	freund1996b	 Y. Freund and R. Schapire.   Game theory, on-line prediction and boosting.   1996.   In Proceedings of the 9th Annual Conference on Computational Learning Theory, 
cora	freund1996b	 Yoav Freund and Robert E. Schapire.   Game theory, on-line prediction and boosting.   1996.   In Proceedings of the Ninth Annual Conference on Computational Learning Theory, 
cora	freund1996b	 Yoav Freund and Robert E. Schapire.   Game theory, on-line prediction and boosting.   1996.   In Proceedings of the Ninth Annual Conference on Computational Learning Theory, 
cora	freund1996b	 Y. Freund and R.E. Schapire.   Game theory, on-line prediction and boosting.   1996.   In Proceedings of the Ninth Annual Conference on Computational Learning Theory, 
cora	freund1996b	 Y. Freund and R. Schapire,   Game theory, on-line prediction and boosting,   1996.   in Proceedings of the 9th Annual Conference on Computational Learning Theory, 
cora	freund1996b	 Y. Freund and R. Schapire.   Game theory, on-line prediction and boosting.   1996.   In COLT-96, 
cora	freund1996b	 Y. Freund and R. Schapire.   Game theory, on-line prediction and boosting.   1996.   In COLT-96, 
cora	freund1996b	 Y. Freund and R. Schapire.   Game theory, on-line prediction and boosting.   1996.   In COLT-96, 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Proceedings of the 13th International Conference on Machine Learning. 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Proceedings of the 13th International Conference on Machine Learning. 
cora	freund1996c	 Freund Y., Schapire R.E.:   Experiments with a New Boosting Algorithm, in Saitta L.(ed.),   1996.   Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, V., & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   Proc. of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. & R.E.   Schapire (1996), Experiments with a New Boosting Algorithm,    in Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. & R.E.   Schapire (1996), Experiments with a new boosting algo rithm,    in Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. & Schapire, R.   Experiments with a new boosting algorithm,   (1996).   Proc. 13th Int. Conf. Machine Learning, 
cora	freund1996c	 Freund, Y. & Schapire, R.   Experiments with a new boosting algorithm.   (1996).   Proc. Thirteenth Conf. Machine Learning (pp. 
cora	freund1996c	 Freund, Y. & Schapire, R.   Experiments with a new boosting algorithm.   (1996).   Proc. Thirteenth Conf. Machine Learning (pp. 
cora	freund1996c	 Freund, Y. & Schapire, R. E.   Experiments with a new boosting algorithm,   (1996),   `Machine Learning: Proceedings of the Thirteenth National Conference', 
cora	freund1996c	 Freund, Y. & Schapire, R. E.   Experiments with a new boosting algorithm,   (1996),   `Machine Learning: Proceedings of the Thirteenth National Conference', 
cora	freund1996c	 Freund, Y. & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   In Proceedings of the 13th International Conference on Machine Learning. 
cora	freund1996c	 Freund, Y. & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. and R.   Schapire (1996). Experiments with a new boosting algorithm.    Machine Learning : Proceedings of the Thirteenth International Conference. 
cora	freund1996c	 Freund, Y. and Schapire, R.E.   Experiments with a New Boosting Algorithm.   1996b.   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. and Schapire, R.E.   Experiments with a New Boosting Algorithm.   1996b.   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. and Schapire, R.E.:   Experiments with a new Boosting algorithm.    Proceedings of the Thirteenth International Conference on Machine Learning. 
cora	freund1996c	 Freund, Y. and Schapire, R.E.:   Experiments with a new boosting algorithm.    Proceedings of the 13th International Conference on Machine Learning. 
cora	freund1996c	 Freund, Y., & Schapire, R.   Experiments with a new boosting algorithm.   (1996).   In Proceedings of the International Conference in Machine Learning San Francisco, 
cora	freund1996c	 Freund, Y., & Schapire, R.   Experiments with a new boosting algorithm.   (1996).   In Proceedings of the International Conference in Machine Learning, 
cora	freund1996c	 Freund, Y., & Schapire, R.   Experiments with a new boosting algorithm.   (1996).   In Proceedings of the International Conference in Machine Learning, 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a new boosting algorithm,   (1996).   Proceedings of the 13rd International Conference of Machine Learning (pp. 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).  
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   In Proceedings Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   Proc. Thirteenth International Conference on Machine Learning (pp. 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   Proc. Thirteenth International Conference on Machine Learning (pp. 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   Proceedings of the 13th International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996).   Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a new boosting algorithm.   (1996b).   In Proceedings Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y., and Schapire, R.   Experiments with a new boosting algorithm.   1996.   In Proc. Thirteenth Conf. Machine Learning, 
cora	freund1996c	 Freund, Y., and Schapire, R.   Experiments with a new boosting algorithm.   1996.   In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y., and Schapire, R. E.   Experiments with a new boosting algorithm.   1996.   In Proc. Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y., and Schapire, R. E.   Experiments with a new boosting algorithm.   1996.   In Proc. Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Yoav and Schapire, Robert E.   Experiments with a New Boosting Algorithm.   (1996).   In Proceedings of the Thirteenth International Conference on Machine Learning. 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Proceedings of the Thirteenth International Conference on Machine Learning. 
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   In Proc. Thirteenth Conf. Machine Learning, 
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   In Proc. Thirteenth Conf. Machine Learning, 
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   Machine Learning Proc of 13th International Conference. 
cora	freund1996c	 Y. Freund., R. E.   Schapire (1996). Experiments with a New Boosting Algorithm.    Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Y. Freund., R. E.   Schapire (1996). Experiments with a New Boosting Algorithm.    Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Y. Freund., R. E.   Schapire (1996). Experiments with a New Boosting Algorithm.    Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   In Proc. Thirteenth Conf. Machine Learning, 
cora	freund1996c	 Y. Freund and R. E. Schapire.   Experiments with a new boosting algorithm.    In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   In Proc. Thirteenth Conf. Machine Learning, 
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   In Proc. Thirteenth Conf. Machine Learning, 
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   In Proc. Thirteenth Conf. Machine Learning, 
cora	freund1996c	 Y. Freund and R.E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of Thirteenth International Conference, 
cora	freund1996c	 Y. Freund and R.E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of Thirteenth International Conference, 
cora	freund1996c	 Y. Freund and R.E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of Thirteenth International Conference, 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a New Boosting Algorithm.   (1996).   Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a New Boosting Algorithm.   (1996).   Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y., & Schapire, R. E.   Experiments with a New Boosting Algorithm.   (1996).   Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   In Proceedings of the Thirteenth International Conference on Machine Learning (ICML-96), 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	freund1996c	 Y. Freund and R. Schapire.   Some experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the International Conference. 
cora	freund1996c	 Y. Freund and R. Schapire.   Some experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the International Conference. 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.   In Machine Learning: Proceedings of the Thirteenth International Conference, 
cora	freund1996c	 Yoav Freund and Robert E. Schapire.   Experiments with a new boosting algorithm.   1996.  
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   In ICML-96, 
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   In ICML-96, 
cora	freund1996c	 Y. Freund and R. Schapire.   Experiments with a new boosting algorithm.   1996.   In ICML-96, 
cora	freund1996c	 Freund Y., Schapire R.E.:   Experiments with a New Boosting Algorithm, in Saitta L.(ed.),   1996.   Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996c	 Freund, Y. and Schapire, R.E.   Experiments with a New Boosting Algorithm.    In Proceedings of the Thirteenth International Conference on Machine Learning, 
cora	freund1996d	 Freund, Y. and Schapire, R.E.   A Decision-theoretic Generalization of On-line Learning and an Application to Boosting.   1996a.  
cora	freund1996d	 Freund, Y. and Schapire, R.E.   A Decision-theoretic Generalization of Online Learning and an Application to Boosting.   1996a.  
cora	freund1996d	 Freund, Y. and Schapire, R.E.:   A decision-theoretic generalization of on-line learn ing and an application to Boosting.   
cora	freund1996d	 Freund, Y. and Schapire, R.E.:   A decision-theoretic generalization of on-line learning and an application to boosting.    Unpublished manuscript, 
cora	freund1996d	 Freund, Y., & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1996).   Unpublished manuscript, 
cora	freund1996d	 Freund, Y., & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1996).   Unpublished manuscript, 
cora	freund1996d	 Freund, Y., & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1996a).   Unpublished manuscript, 
cora	freund1996d	 Freund, Y., and Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.Unpublished manuscript, available from the authors' home pages ("http://www.research. att.com/orgs/ssr/people/fyoav,schapireg"). An extended abstract appears in Computational Learning Theory:   1996a. </date> <i> A decision-theoretic generalization of on-line learning and an application to boosting.Unpublished manuscript, available from the authors' home pages ("http://www.research. att.com/orgs/ssr/people/fyoav,schapireg"). An extended abstract appears in Computational Learning Theory: </i> <venue> Second European Conference, </venue> <volume> EuroCOLT '95, </volume> <pages> 23-27, </pages> <publisher> Springer-Verlag, </publisher> <date> 1995.   Second European Conference, 
cora	freund1996d	 Freund, Y., and Schapire, R.E.   "A decision-theoretic generalization of on-line learning and an application to boosting", at web site: http://www.research.att.com/yoav. or http://www.research.att.com/orgs/ssr/people/yoav. An extended abstract appears in the Proceedings of the Second European Conference on Computational Learning Theory, Barcelona,   (1996b). </date> <i> "A decision-theoretic generalization of on-line learning and an application to boosting", at web site: http://www.research.att.com/yoav. or http://www.research.att.com/orgs/ssr/people/yoav. An extended abstract appears in the Proceedings of the Second European Conference on Computational Learning Theory, Barcelona, </i> <publisher> Springer-Verlag, </publisher> <month> March, </month> <date> 1995,  
cora	freund1996d	 Yoav Freund and Robert E. Schapire.   A decision-theoreticgeneralizationof online learning and an application to boosting. Unpublishedmanuscript available electronically (on our web pages, or by email request). An extended abstract appeared in Computational Learning Theory:   1995.   Second European Conference, 
cora	freund1996d	 Freund, Y. and Schapire, R.E.   A Decision-theoretic Generalization of On-line Learning and an Application to Boosting.   
cora	freund1996e	 Freund, Y., and Schapire, R. E.   Experiments with a new boosting algorithm.   1996b.   Unpublished manuscript. 
cora	freund1996e	 Y. Freund and R. Schapire.   Some experiments with a new boosting algorithm.   1996.   Unpublished manuscript, 
cora	freund1997a	 Freund, Y. & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1997).   Journal of Computer and System Sciences ,55(1), 
cora	freund1997a	 Freund, Y. and Schapire, R.   [1995] A decision-theoretic generalization of online learning and an application to boosting.   
cora	freund1997a	 Freund, Y. and Schapire, R.   [1995] A decision-theoretic generalization of online learning and an application to boosting.   
cora	freund1997a	 Freund, Y., & Schapire, R. E.   A decision-theoretic generalization of on-line learning and an application to boosting.   (1997).   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Y. Freund and R. Schapire.   A decision-theoretic generalization of on-line learning algorithms and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Y. Freund and R.E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1995.   Journal of Computer and System Sciences, 
cora	freund1997a	 Y. Freund and R.E. Schapire.   A decision theoretic generalization of on-line learning and an application to boosting.    Journal of Computer and System Science, 
cora	freund1997a	 Y. Freund and R.E. Schapire.   A decision theoretic generalization of on-line learning and an application to boosting.    Journal of Computer and System Science, 
cora	freund1997a	 Y. Freund and R.E. Schapire.   A decision theoretic generalization of on-line learning and an application to boosting.    Journal of Computer and System Science, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.    Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Y. Freund and R. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and Systems Sciences, 
cora	freund1997a	 Y. Freund and R. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and Systems Sciences, 
cora	freund1997a	 Y. Freund and R. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and Systems Sciences, 
cora	freund1997a	 Y. Freund and R.E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer Science and System Sciences, 
cora	freund1997a	 Yoav Freund and Robert E. Schapire.   A decision-theoretic generalization of on-line learning and an application to boosting.   1997.   Journal of Computer and System Sciences, 
cora	freund1997b	 Freund, Y., Schapire, R. E., Singer, Y., & Warmuth, M. K.   Using and combining predictors that specialize.   (1997).   In Proceedings of the Twentyninth Annual ACM Symposium on Theory of Computing. 
cora	freund1997b	 Yoav Freund, Robert E. Schapire, Yoram Singer, and Man-fred K. Warmuth.   Using and combining predictors that specialize.   1997.   In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 
cora	freund1997b	 Yoav Freund, Robert E. Schapire, Yoram Singer, and Man-fred K. Warmuth.   Using and combining predictors that specialize.   1997.   In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 
cora	freund1997b	 Yoav Freund, Robert E. Schapire, Yoram Singer, and Manfred K. Warmuth.   Using and combining predictors that specialize.   1997.   In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 
cora	freund1997b	 Yoav Freund, Robert E. Schapire, Yoram Singer, and Manfred K. Warmuth.   Using and combining predictors that specialize.   1997.   In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 
cora	freund1997b	 Yoav Freund, Robert E. Schapire, Yoram Singer, and Manfred K. Warmuth.   Using and com-bining predictors that specialize.   1997.   In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 
cora	freund1997b	 Yoav Freund, Robert E. Schapire, Yoram Singer, and Manfred K. Warmuth.   Using and com-bining predictors that specialize.   1997.   In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 
cora	freund1997c	 Freund, Y., Seung, H. S., Shamir, E., & Tishby, N.   Selective sampling using the query by committee algorithm.   (1997).   Machine Learning, 
cora	freund1997c	 Freund, Y.; Seung, H.; Shamir, E.; and Tishby, N.   Selective sampling using the query by committee algorithm.   1997.   Machine Learning 28 
cora	freund1997c	 Freund, Y.; Seung, H.; Shamir, E.; and Tishby, N.   Selective sampling using the query by committee algorithm.   1997.   Machine Learning 28 
cora	freund1997c	 Freund, Y.; Seung, H.; Shamir, E.; and Tishby, N.   Selective sampling using the query by committee algorithm.   1997.   Machine Learning 28 
cora	freund1997c	 Freund, Y.; Seung, H.; Shamir, E.; and Tishby, N.   Selective sampling using the query by committee algorithm.   1997.   Machine Learning 28 
cora	freund1997c	 Freund, Y.; Seung, H.; Shamir, E.; and Tishby, N.   Selective sampling using the query by committee algorithm.   1997.   Machine Learning 28 
cora	freund1997c	 Freund, Y.; Seung, H.; Shamir, E.; and Tishby, N.   Selective sampling using the query by committee algorithm.   1997.   Machine Learning 28 
cora	freund1997c	 Y. Freund, H. Seung, E. Shamir, and N. Tishby.   Selective sampling using the query by committee algorithm.   1997.   Machine Learning, 
cora	freund1997c	 Y. Freund, H. Seung, E. Shamir, and N. Tishby.   Selective sampling using the query by committee algorithm.   1997.   Machine Learning, 
cora	freund1997c	 Y. Freund, H. Seung, E. Shamir, and N. Tishby.   Selective sampling using the query by committee algorithm.   1997.   Machine Learning, 
cora	freund1997c	 Y. Freund, H. Seung, E. Shamir, and N. Tishby.   Selective sampling using the query by committee algorithm.   1997.   Machine Learning, 
cora	freund1997c	 Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby,   Selective Sampling Using the Query by Committee Algorithm,   1995  
cora	freund1997c	 Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby,   Selective Sampling Using the Query by Committee Algorithm,   1995,  
cora	freund1997d	 Y. Freund and Y. Mansour.   Learning under persistent drift.   1997.   Proceedings of the Third European Conference on Computational Learning Theory (EuroCOLT'97), volume 1208 of Lecture Notes in Computer Science, 
cora	freund1997d	 Y. Freund and Y. Mansour.   Learning under persistent drift.   1997.   Proceedings of the 1997 European Conference on Computational Learning Theory, 
cora	freund1997d	 Y. Freund and Y. Mansour.   Learning under persistent drift.   1997.   Proceedings of the 1997 European Conference on Computational Learning Theory, 
cora	goldman1989	 Goldman, S.; Rivest, R.; and Schapire, R.   Learning binary relations and total orders.   1989.   In Proceedings of 30th Annual Symposium on Foundation of Computer Science. 
cora	goldman1989	 Sally A. Goldman, Ronald L. Rivest, and Robert E. Schapire.   Learning binary relations and total orders.   1989.   In 30th Annual Symposium on Foundations of Computer Science, 
cora	goldman1989	 Sally A. Goldman, Ronald L. Rivest, and Robert E. Schapire.   Learning binary relations and total orders.   1989.   In Proceedings of the Thirtieth Annual Symposium on Foundations of Computer Science, 
cora	goldman1989	 S.A. Goldman, R.L. Rivest, and R.E. Schapire.   Learning binary relations and total orders.   1989.   Proceedings of the 30th Annual Symposium on the Foundations of Computer Science, 
cora	goldman1989	 S.A. Goldman, R.L. Rivest, and R.E. Schapire.   Learning binary relations and total orders.   1989.   Proceedings of the 30th Annual Symposium on the Foundations of Computer Science, 
cora	goldman1990	 Goldman, S., Kearns, M. J., and Schapire, R.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proceedings of the Thirty First Annual IEEE Symposium on Foundations of Computer Science (FOCS-90), 
cora	goldman1990	 Goldman, S., Kearns, M. J., and Schapire, R.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proceedings of the Thirty First Annual IEEE Symposium on Foundations of Computer Science (FOCS-90), 
cora	goldman1990	 Goldman, S., Kearns, M. J., and Schapire, R.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proceedings of the Thirty First Annual IEEE Symposium on Foundations of Computer Science (FOCS-90), 
cora	goldman1990	 Goldman, S., Kearns, M., & Schapire, R.   Exact identification of circuits using fixed points of amplification functions.   (1990).   In Proceedings of the Thirty-First Annual Symposium on Foundations of Computer Science, 
cora	goldman1990	 S. Goldman, M. Kearns, and R. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990.   In FOCS-90, 
cora	goldman1990	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	goldman1990	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	goldman1990	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990.   In 31st Annual Symposium on Foundations of Computer Science, 
cora	goldman1990	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proceedings of the 31st Symposium on Foundations of Computer Science, 
cora	goldman1990	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proceedings of the 31st Symposium on Foundations of Computer Science, 
cora	goldman1990	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proceedings of the 31st Symposium on Foundations of Computer Science, 
cora	goldman1990	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proceedings of the 31st Symposium on Foundations of Computer Science, 
cora	goldman1990	 S. Goldman, M. Kearns, and R. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990,   In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 
cora	goldman1990	 S. Goldman, M. Kearns, and R. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proceedings of the Thirty First Annual Symposium on Foundations of Computer Science, 
cora	goldman1990	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1990.   In Proceedings of the 31st Symposium on Foundations of Computer Science, 
cora	goldman1990a	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   On the sample complexity of weak learning.   1990.   In Proceedings of COLT '90, 
cora	goldman1990a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   On the sample complexity of weak learning.   1990.   In Proceedings of the 3rd Workshop on Computational Learning Theory, 
cora	goldman1990a	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   On the sample complexity of weak learning.   1990.   In Proceedings of the Third Annual Workshop on Computational Learning Theory, 
cora	goldman1990a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   On the sample complexity of weak learning.   1990.   In Proceedings of the 3rd Workshop on Computational Learning Theory, 
cora	goldman1990a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   On the sample complexity of weak learning.   1990.   In Proceedings of the 3rd Workshop on Computational Learning Theory, 
cora	goldman1990a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   On the sample complexity of weak learning.   1990.   In Proceedings of the 3rd Workshop on Computational Learning Theory, 
cora	goldman1990a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   On the sample complexity of weak learning.   1990.   In Proceedings of the 3rd Workshop on Computational Learning Theory, 
cora	goldman1990a	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   On the sample complexity of weak learning.   1990.   In Proceedings of COLT '90, 
cora	goldman1990a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   On the sample complexity of weak learning.   1990.   In Proc. 3rd Annu. Workshop on Comput. Learning Theory, 
cora	goldman1990a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   On the sample complexity of weak learning.   1990.   In Proc. 3rd Annu. Workshop on Comput. Learning Theory, 
cora	goldman1990a	 Sally A. Goldman, Michael J. Kerns, and Robert E. Schapire.   On the sample complexity of weak learning.    In Proceedings of the 1990 Workshop on Computational Learning Theory, 
cora	goldman1990c	 Sally A. Goldman, Ronald L. Rivest, and Robert E. Schapire.   Learning binary relations and total orders.   1990. </date> <note> A preliminary version is available in Proceedings of the Thirtieth Annual Symposium on Foundations of Computer Science, pages 46-51, </note> <date> 1989.   Technical Report MIT/LCS/TM-413, 
cora	goldman1990c	 Sally A. Goldman, Ronald L. Rivest, and Robert E. Schapire.   Learning binary relations and total orders.   1990. </date> <note> A preliminary version is available in Proceedings of the Thirtieth Annual Symposium on Foundations of Computer Science, pages 46-51, </note> <date> 1989.   Technical Report MIT/LCS/TM-413, 
cora	goldman1991	 Goldman, S. A. & Kearns, M. J.   On the complexity of teaching.   (1991).   Proceedings of the Fourth Annual Workshop on Computational Learning Theory (pp. 
cora	goldman1991	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1991.   In Proc. 4th Annu. Workshop on Comput. Learning Theory, 
cora	goldman1991	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1991.   In Proc. 4th Annu. Workshop on Comput. Learning Theory, 
cora	goldman1991	 Sally A. Goldman and Michael J. Kearns.   On the complexity of teaching.   1991.   In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	goldman1991	 S. Goldman and M. Kearns.   On the complexity of teaching.    In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	goldman1991	 S. Goldman and M. Kearns,   "On the complexity of teaching",   1991,   in Proc. of the Fourth Annual Workshop on Computational Learning Theory, 
cora	goldman1991	 S. Goldman and M. Kearns,   "On the complexity of teaching",   1991,   in Proc. of the Fourth Annual Workshop on Computational Learning Theory, 
cora	goldman1991	 S. Goldman and M. Kearns,   "On the complexity of teaching",   1991,   in Proc. of the Fourth Annual Workshop on Computational Learning Theory, 
cora	goldman1991	 S. Goldman and M. Kearns,   "On the complexity of teaching",   1991,   in Proc. of the Fourth Annual Workshop on Computational Learning Theory, 
cora	goldman1991	 S. Goldman and M. Kearns.   On the Complexity of Teaching.   1991.   Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	goldman1991	 S. Goldman and M. Kearns.   On the Complexity of Teaching.   1991.   Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	goldman1991	 Goldman, S.A., and M.J. Kearns.   (1991) On the Complexity of Teaching.   
cora	goldman1991	 Goldman, S.A., and M.J. Kearns.   (1991) On the Complexity of Teaching.   
cora	goldman1991	 S.A Goldman and M.J. Kearns.   On the complexity of teaching.   1991.   Proceedings of the Fourth Annual Workshop on Computational Learning Theory. 
cora	goldman1991	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1991.   In Proc. 4th Annu. Workshop on Comput. Learning Theory, 
cora	goldman1991	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1991.   In Proc. 4th Annu. Workshop on Comput. Learning Theory, 
cora	goldman1991	 Goldman, S.A., and M.J. Kearns,   "On the complexity of teaching,"   1991,   Proc. Forth ACM Workshop on Computational Learning Theory, 
cora	goldman1991	 Sally A. Goldman and Michael J. Kearns.   On the complexity of teaching.   1991.   In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	goldman1991	 S. Goldman and M. Kearns.   On the complexity of teaching.   1991.   In COLT-91, 
cora	goldman1991	 Sally A. Goldman and Michael J. Kearns.   On the Complexity of Teaching.    Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	goldman1993	 S. A. Goldman, R. L. Rivest, and R. E. Schapire.   Learning binary relations and total orders.   1993.   SIAM Journal on Computing, 
cora	goldman1993	 S. A. Goldman, R. L. Rivest, and R. E. Schapire.   Learning binary relations and total orders.   1993.   SIAM Journal on Computing, 
cora	goldman1993	 S. A. Goldman, R. L. Rivest, and R. E. Schapire.   Learning binary relations and total orders.   1993.   SIAM Journal on Computing, 
cora	goldman1993	 S. A. Goldman, R. L. Rivest, and R. E. Schapire.   Learning binary relations and total orders.   1993.   SIAM Journal on Computing, 
cora	goldman1993	 S. A. Goldman, R. L. Rivest, and R. E. Schapire,   "Learning Binary Relations and Total Orders",   1993.   SIAM Journal on Computing, 
cora	goldman1993	 Sally A. Goldman, Ronald L. Rivest, and Robert E. Schapire.   Learning binary relations and total orders.   1993.   SIAM Journal of Computing, 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of read-once formulas using fixed points of amplification functions.   (1993).   SIAM Journal on Computing, 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of read-once formulas using fixed points of amplification functions.    SIAM Journal on Computing, 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of read-once formulas using fixed points of amplification functions.    SIAM Journal on Computing, 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of read-once formulas using fixed points of amplification functions.    SIAM Journal on Computing, 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of read-once formulas using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   Exact identifi-cation of circuits using fixed points of amplification functions.   1993.   SIAM Journal on Computing, 
cora	goldman1993a	 Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire.   Exact identifi cation of circuits using fixed points of amplification functions.   1993.   SIAM Journal on Computing, 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of read-once formulas using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 S. A. Goldman, M. J. Kearns, and R. E. Schapire.   Exact identification of read-once formulas using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1993a	 S. Goldman, M. Kearns, and R. Schapire.   Exact identification of circuits using fixed points of amplification functions.   1993.   SIAM J. Comput., 
cora	goldman1995	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1995.   Journal of Computer and System Sciences, 
cora	goldman1995	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1995.   Journal of Computer and System Sciences, 
cora	goldman1995	 Goldman, S. A., & Kearns, M. J.   On the complexity of teaching.   (1995).   JCSS 50(1): 
cora	goldman1995	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1995.   Journal of Computer and System Sciences, 
cora	goldman1995	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1995.   Journal of Computer and System Sciences, 
cora	goldman1995	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1995.   Journal of Computer and System Sciences, 
cora	goldman1995	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1995.   Journal of Computer and System Sciences, 
cora	goldman1995	 S. A. Goldman and M. J. Kearns.   On the complexity of teaching.   1995.   Journal of Computer and System Sciences, 
cora	haussler1988	 D. Haussler, M. Kearns, N. Littlestone, M. Warmuth.   Equivalence of models for polynomial learnability.   1988, </date> <pages> pp. 42-55, </pages> <institution> and University of California at Santa Cruz Information Sciences Department, </institution> <venue> technical report number UCSC-CRL-88-06, </venue> <date> 1988.   Proceedings of the 1988 Workshop on Computational Learning Theory, </venue> <publisher> Morgan Kaufmann Publishers, </publisher> <date> 1988, </date> <pages> pp. 42-55, </pages> <institution> and University of California at Santa Cruz Information Sciences Department, </institution> <venue> technical report number UCSC-CRL-88-06, 
cora	haussler1988	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1988.   Information and Computation. 
cora	haussler1988	 D. Haussler, M. Kearns, N. Littlestone, M. Warmuth.   Equivalence of models for polynomial learnability.   1988, </date> <pages> pp. 42-55, </pages> <institution> and University of California at Santa Cruz Information Sciences Department, </institution> <venue> technical report number UCSC-CRL-88-06, </venue> <date> 1988.   Proceedings of the 1988 Workshop on Computational Learning Theory, </venue> <publisher> Morgan Kaufmann Publishers, </publisher> <date> 1988, </date> <pages> pp. 42-55, </pages> <institution> and University of California at Santa Cruz Information Sciences Department, </institution> <venue> technical report number UCSC-CRL-88-06, 
cora	haussler1988	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. War-muth.   Equivalence of models for polynomial learnability.   1988.   In Proceedings of the 1988 Workshop on Computational Learning Theory, 
cora	haussler1988	 D. Haussler, M. Kearns, N. Littlestone, M. Warmuth.   Equivalence of models for polynomial learnability.   1988, </date> <pages> pp. 42-55, </pages> <institution> and University of California at Santa Cruz Information Sciences Department, </institution> <venue> technical report number UCSC-CRL-88-06, </venue> <date> 1988.   Proceedings of the 1988 Workshop on Computational Learning Theory, </venue> <publisher> Morgan Kaufmann Publishers, </publisher> <date> 1988, </date> <pages> pp. 42-55, </pages> <institution> and University of California at Santa Cruz Information Sciences Department, </institution> <venue> technical report number UCSC-CRL-88-06, 
cora	haussler1988	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1988.   In Proceedings of the 1988 Workshop on Computational Learning Theory, 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. War-muth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. War-muth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.    Information and Computation. 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.    Information and Computation. 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. War-muth.   Equivalence of models for polynomial learnabil-ity. Information and Computation,   1991.  
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Lit-tlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1990.   Information and Computation, 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equiva lence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equiva lence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 D. Haussler, M. Kearns, N. Littlestone, and M. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Inform. Comput., 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991	 HAUSSLER, D., KEARNS, M., LITTLESTONE, N. and WARMUTH, M.K.   Equiv--alence of models for polynomial learnability. Information and Computation, to appear.   (1991),   An extended abstract appeared in Proceedings of the 1st Workshop on Computational Learning Theory, 
cora	haussler1991	 David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth.   Equivalence of models for polynomial learnability.   1991.   Information and Computation, 
cora	haussler1991c	 Haussler, D., Kearns, M. J., and Schapire, R.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the Fourth Annual Conference on Computational Learning Theory (COLT-91), 
cora	haussler1991c	 Haussler, D., Kearns, M. J., and Schapire, R.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the Fourth Annual Conference on Computational Learning Theory (COLT-91), 
cora	haussler1991c	 Haussler, D., Kearns, M. J., and Schapire, R.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the Fourth Annual Conference on Computational Learning Theory (COLT-91), 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension.    Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 61--74, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the 4th Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M Kearns, and R. Shapire.   Bounds on the sample complexity of bayesian learning using information theory and the vc dimension.    In COLT-91: Proceedings of the 4th Annual Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the 4th Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the 4th Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the 4th Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the 4th Workshop on Computational Learning Theory, 
cora	haussler1991c	 David Haussler, Michael Kearns, and Rob Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Computational Learning Theory: Proceedings of the Fourth Annual Workshop. 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.    In Proc. 4th Annu. Workshop on Comput. Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.    In Proc. 4th Annu. Workshop on Comput. Learning Theory, 
cora	haussler1991c	 D. Haussler, M Kearns, and R. Shapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.    In COLT-91: Proceedings of the 4th Annual Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. Schapire,   Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension,   1991.   Proc. 4th Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M Kearns, and R. Shapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.    In COLT-91: Proceedings of the 4th Annual Workshop on Computational Learning Theory, 
cora	haussler1991c	 David Haussler, Michael Kearns, and Robert E. Schapire,   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension,   1991,   Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of bayesian learning using information theory and the VC-dimension.   1991.   The 1991 Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. Schapire.   Unifying bounds on the sample complexity of Bayesian learning theory using information theory and the VC dimension.    In Proceedings of the 4th Annual Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. Schapire.   Unifying bounds on the sample complexity of Bayesian learning theory using information theory and the VC dimension.    In Proceedings of the 4th Annual Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning theory using information theory and the VC dimension.    In Proceedings of the 4th Annual Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the 1991 Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the Fourth Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the Fourth Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of bayesian learning using information theory and the VC dimension.    Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	haussler1991c	 David Haussler, Michael Kearns, and Robert Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	haussler1991c	 David Haussler, Michael Kearns, and Robert Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1991.   In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	haussler1991c	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.    In Proc. 4th Annu. Workshop on Comput. Learning Theory, 
cora	haussler1991c	 David Haussler, Michael Kearns, and Robert Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.    In Proceedings of the 1991 Workshop on Computational Learning Theory, 
cora	haussler1991c	 David Haussler, Michael Kearns, and Robert Schapire.   Bounds on the sample complexity of bayesian learning using information theory and the vc dimension.    In Proceedings of the 1991 Workshop on Computational Learning Theory, 
cora	haussler1991p	 D. Haussler, M. Kearns and R.   Schapire (1991). `Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension',    preprint. 
cora	haussler1991p	 D. Haussler, M. Kearns and R.   Schapire (1991). `Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension',    preprint. 
cora	haussler1991p	 D. Haussler, M. Kearns and R.   Schapire (1991). `Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension',    preprint. 
cora	haussler1991p	 D. Haussler, M. Kearns and R.   Schapire (1991). Bounds on the sample complexity of Bayesian learning using information theory and the V-C dimension,    preprint. 
cora	haussler1992	 Haussler, D., Kearns, M. and Schapire, R.   Bounds on the sample complexity of bayesian learning using information theory and the VC dimension.   (1992).  
cora	haussler1992	 Haussler, D., Kearns, M. and Schapire, R.   Bounds on the sample complexity of bayesian learning using information theory and the VC dimension.   (1992).  
cora	haussler1992	 Haussler, D., Kearns, M. and Schapire, R.   Bounds on the sample complexity of bayesian learning using information theory and the VC dimension.   (1992).  
cora	haussler1994	 D. Haussler, M. Kearns, H. S. Seung, and N. Tishby.   Rigorous learning curve bounds from statistical mechanics.    Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 
cora	haussler1994	 Haussler, D., Kearns, M. J., Seung, H. S., and Tishby, N.   Rigorous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual Conference on Computational Learning Theory (COLT-94), 
cora	haussler1994	 Haussler, D., Kearns, M. J., Seung, H. S., and Tishby, N.   Rigorous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual Conference on Computational Learning Theory (COLT-94), 
cora	haussler1994	 Haussler, D., Kearns, M. J., Seung, H. S., and Tishby, N.   Rigorous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual Conference on Computational Learning Theory (COLT-94), 
cora	haussler1994	 Haussler, D., Kearns, M., Seung, H. S. & Tishby, N.   Rigorous learning curve bounds from statistical mechanics,   (1994),   in "Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory", 
cora	haussler1994	 Haussler, D., Kearns, M., Seung, H. S. & Tishby, N.   Rigorous learning curve bounds from statistical mechanics,   (1994),   in "Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory", 
cora	haussler1994	 Haussler, D., Kearns, M., Seung, H. S., & Tishby, N.   Rigorous learning curve bounds from statistical mechanics.   (1994).   In Proc. 7th Annu. ACM Workshop on Comput. Learning Theory, 
cora	haussler1994	 Haussler, D., Kearns, M., Seung, H. S., and Tishby, N.   Rigorous Learning Curve Bounds from Statistical Mechanics..   (1994).   In COLT (1994), 
cora	haussler1994	 Haussler, D., Kearns, M., Seung, H. S., and Tishby, N.   Rigorous Learning Curve Bounds from Statistical Mechanics..   (1994).   In COLT (1994), 
cora	haussler1994	 Haussler, D., Kearns, M., Seung, H. S., and Tishby, N.   Rigorous learning curve bounds from statistical mechanics.   (1994).   In Proceedings of the 7th Annual ACM Workshop on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H. S. Seung, and N. Tishby.   Rigorous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual ACM Workshop on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H. S. Seung, and N. Tishby.   Rigorous learning curve bounds from statistical mechanics.    In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby.   Rigourous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual ACM Confernce on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby.   Rigourous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual ACM Confernce on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby.   Rigourous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual ACM Confernce on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby.   Rigourous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual ACM Confernce on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby.   Rigourous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual ACM Confernce on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H. S. Seung, and N. Tishby.   Rigorous learning curve bounds from statistical mechanics.   1994.   In Proc. 7th Annual Workshop on Comput. Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H. S. Seung, and N. Tishby.   Rigorous learning curve bounds from statistical mechanics.   1994.   In Proc. 7th Annual Workshop on Comput. Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H. S. Seung, and N. Tishby.   Rigorous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the 7th Annual ACM Workshop on Computational Learning Theory, 
cora	haussler1994	 Haussler D., M. Kearns, H. S. Seung, and N. Tishby,   "Rigorous Learning Curve Bounds from Statistical Mechanics" Proceedings of COLT-94,   1994.  
cora	haussler1994	 Haussler D., M. Kearns, H. S. Seung, and N. Tishby.   "Rigorous Learning Curve Bounds from Statistical Mechanics" Proceedings of COLT-94,   1994.  
cora	haussler1994	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby,   "Rigorous learning curve bounds from statistical mechanics",   1994,   in Proceedings of the Seventh ACM Conference on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby,   "Rigorous learning curve bounds from statistical mechanics",   1994,   in Proceedings of the Seventh ACM Conference on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby,   "Rigorous learning curve bounds from statistical mechanics",   1994,   in Proceedings of the Seventh ACM Conference on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby,   "Rigorous learning curve bounds from statistical mechanics",   1994,   in Proceedings of the Seventh ACM Conference on Computational Learning Theory, 
cora	haussler1994	 D. Haussler, M. Kearns, H.S. Seung and N. Tishby,   "Rigorous Learning Curve Bounds from Statistical Mechanics",   1994.   in Proceedings of the seventh workshop on Computational Learning Theory", 
cora	haussler1994	 D. Haussler, M. Kearns, S. Seung, N Tishby,   "Rigorous Learning Curve Bounds from Statistical Mechanics",    Proceedings of COLT 1994, 
cora	haussler1994	 D. Haussler, M. Kearns, S. Seung, N Tishby,   "Rigorous Learning Curve Bounds from Statistical Mechanics",    Proceedings of COLT 1994, 
cora	haussler1994	 D. Haussler, M. Kearns, S. Seung, N Tishby,   "Rigorous Learning Curve Bounds from Statistical Mechanics",    Proceedings of COLT 1994, 
cora	haussler1994	 D. Haussler, M. Kearns, H. S. Seung, N. Tishby,   Rigorous learning curve bounds from statistical mechanics,    Proc. of the 7th Annual ACM Conference on Computational Learning Theory 1994, ACM-Press (1994), 
cora	haussler1994	 D. Haussler, M. Kearns, H. S. Seung, and N. Tishby.   Rigorous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual Workshop on Computational Learning Theory (COLT-94), 
cora	haussler1994	 D. Haussler, M. Kearns, H. S. Seung, and N. Tishby.   Rigorous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual Workshop on Computational Learning Theory (COLT-94), 
cora	haussler1994	 D. Haussler, M. Kearns, H. S. Seung, and N. Tishby.   Rigorous learning curve bounds from statistical mechanics.   1994.   In Proceedings of the Seventh Annual Workshop on Computational Learning Theory (COLT-94), 
cora	haussler1994a	 David Haussler, Michael Kearns, and Robert E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 David Haussler, Michael Kearns, and Robert E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 Haussler, David; Kearns, Michael; and Schapire, Robert 1994.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.    Machine Learning 14(1) 
cora	haussler1994a	 Haussler, D.; Kearns, M.; and Schapire, R.E.   Bounds on the sample complexity of Bayesian learning using informations theory and the VC dimension.   1994.   Machine Learning 14 
cora	haussler1994a	 Haussler, D.; Kearns, M.; and Schapire, R.E.   Bounds on the sample complexity of Bayesian learning using informations theory and the VC dimension.   1994.   Machine Learning 14 
cora	haussler1994a	 Haussler, D.; Kearns, M.; and Schapire, R.E.   Bounds on the sample complexity of Bayesian learning using informations theory and the VC dimension.   1994.   Machine Learning 14 
cora	haussler1994a	 Haussler, D.; Kearns, M.; and Schapire, R.E.   Bounds on the sample complexity of Bayesian learning using informations theory and the VC dimension.   1994.   Machine Learning 14 
cora	haussler1994a	 Haussler, D.; Kearns, M.; and Schapire, R.E.   Bounds on the sample complexity of Bayesian learning using informations theory and the VC dimension.   1994.   Machine Learning 14 
cora	haussler1994a	 David Haussler, Michael Kearns, and Robert Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.    Machine Learning, 
cora	haussler1994a	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 D. Haussler, M. Kearns, and R. E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning using information thjeory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 D. Haussler, M. Kearns, R.   Schapire,   (1994).   Machine Learning, 
cora	haussler1994a	 D. Haussler, M Kearns, and R. Shapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning Journal, 
cora	haussler1994a	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 David Haussler, Michael Kearns, and Robert E. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.   1994.   Machine Learning, 
cora	haussler1994a	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.    Machine Learning. 
cora	haussler1994a	 D. Haussler, M. Kearns, and R. Schapire.   Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension.    Machine Learning, 
cora	haussler1996	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby.   Rigourous learning curve bounds from statistical mechanics.   1996.   Machine Learning, 
cora	haussler1996	 David Haussler, Michael Kearns, H. Sebastian Seung, and Naftali Tishby.   Rigorous learning curve bounds from statistical mechanics.   1996.   Machine Learning, 
cora	haussler1996	 D. Haussler, M. Kearns, H.S. Seung, and N. Tishby.   Rigorous learning curve bounds from statistical mechanics.   1996.   Machine Learning, 
cora	helmbold1995	 D.P. Helmbold and R.E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.   1995.   In Proceedings of the Eighth Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmbold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.   1995.   In Proceedings of the Eighth Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmbold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.   1995.   In Proceedings of the Eighth Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmbold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.   1995.   In Proceedings of the Eighth Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmhold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.    In Proceedings of the 8th Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmhold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.    In Proceedings of the 8th Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmhold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.    In Proceedings of the 8th Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmhold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.    In Proceedings of the 8th Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmhold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.    In Proceedings of the 8th Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmhold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.    In Proceedings of the 8th Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmhold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.    In Proceedings of the 8th Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmhold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.    In Proceedings of the 8th Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmhold and Robert E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.    In Proceedings of the 8th Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 David P. Helmbold and Robert E. Schapire.   Predicting Nearly as Well as the Best Pruning of a Decision Tree.   1995.   Proceedings of the Eighth Annual Conference on Computational Learning Theory, 
cora	helmbold1995	 D. P. Helmbold and R. E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.   1995.   In Proc. 6th Annu. Conf. on Comput. Learning Theory, 
cora	helmbold1995	 D. P. Helmbold and R. E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.   1995.   To appear in the Proceedings of the Eighth Annual Conference on Computational Learning Theory, 
cora	helmbold1995a	 David P. Helmbold, Robert E. Schapire, Yoram Singer, and Manfred K. Warmuth.   A comparison of new and old algorithms for a mixture estimation problem.   1995.   In Proceedings of the Eighth Annual Conference on Computational Learning Theory, 
cora	helmbold1995a	 D. P. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth.   A comparison of new and old algorithms for a mixture estimation problem.   1995.   In Proceedings of the Eighth Annual Workshop on Computational Learning Theory, 
cora	helmbold1995a	 D.P. Helmbold, R.E. Schapire, Y. Singer,   M.K. Warmuth, A comparison of new and old algorithms for a mixture estimation problem,   1995   Appearing in Proc. of the Eighth Annual Conf. on Computational Learning Theory, 
cora	helmbold1995a	 D. P. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth.   A comparison of new and old algorithms for a mixture estimation problem.   1995.   In Proceedingsof the Eighth Annual Workshop on ComputationalLearning Theory, 
cora	helmbold1995a	 D. P. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth.   A comparison of new and old algorithms for a mixture estimation problem.   1995.   In Proceedingsof the Eighth Annual Workshop on ComputationalLearning Theory, 
cora	helmbold1995a	 D. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth.   A comparison of new and old algorithms for a mixture estimation problem.   1995.   Technical Report UCSC-CRL-95-50, 
cora	helmbold1996	 D. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth.   On-line portfolio selection using multiplicative updates.   1996.   In Proc. 13th International Conference on Machine Learning, 
cora	helmbold1996	 D. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth.   On-line portfolio selection using multiplicative updates.   1996.   In Proc. 13th International Conference on Machine Learning, 
cora	helmbold1996	 D. Helmbold, R. Schapire, Y. Singer, and M. War muth.   On-line portfolio selection using multiplicative updates.   1996.   In Machine Learning: Proceedings of the 13th International Conference. 
cora	helmbold1996	 D. Helmbold, R. Schapire, Y. Singer, and M. War-muth.   On-line portfolio selection using multiplicative updates.   1996.   In Machine Learning: Proceedings of the 13th International Conference. 
cora	helmbold1996	 D. Helmbold, R. Schapire, Y. Singer, and M. War-muth.   On-line portfolio selection using multiplicative updates.   1996.   In Machine Learning: Proceedings of the 13th International Conference. 
cora	helmbold1996	 D. Helmbold, R. Schapire, Y. Singer, and M. War-muth.   On-line portfolio selection using multiplicative updates.   1996.   In Machine Learning: Proceedings of the 13th International Conference. 
cora	helmbold1996	 D. Helmbold, R. Schapire, Y. Singer, and M. War-muth.   On-line portfolio selection using multiplicative updates.   1996.   In Machine Learning: Proceedings of the 13th International Conference. 
cora	helmbold1996	 D. Helmbold, R. Schapire, Y. Singer, and M. War-muth.   On-line portfolio selection using multiplicative updates.   1996.   In Machine Learning: Proceedings of the 13th International Conference. 
cora	helmbold1996	 D. Helmbold, R. Schapire, Y. Singer, and M. War-muth.   On-line portfolio selection using multiplicative updates.   1996.   In Machine Learning: Proceedings of the 13th International Conference. 
cora	helmbold1996	 Helmbold, D. P., R. E. Schapire, Y. Singer and M. K.   Warmuth (1996). On-line portfolio selection using multilpicative updates.   1997.   In: Machine Learning: Proceedings of the Thirteenth International Conference. 
cora	helmbold1996	 Helmbold, D. P., Schapire, R. E., Singer, Y., and Warmuth, M. K.   On-line portfolio selection using multiplicative updates,   (1996c),   in "Proceedings, 13th International Conference on Machine Learning," 
cora	helmbold1996	 Helmbold, D. P., Schapire, R. E., Singer, Y., and War-muth, M. K.   On-line portfolio selection using multiplicative updates.   1996. </date> <i> On-line portfolio selection using multiplicative updates. </i> <venue> In Machine Learning: Proceedings of the Thirteenth International Conference. </venue> <month> Revised July, </month> <date> 1997.   In Machine Learning: Proceedings of the Thirteenth International Conference. 
cora	helmbold1996	 Helmbold, D. P., Schapire, R. E., Singer, Y., and War-muth, M. K.   On-line portfolio selection using multiplicative updates.   1996. </date> <i> On-line portfolio selection using multiplicative updates. </i> <venue> In Machine Learning: Proceedings of the Thirteenth International Conference. </venue> <month> Revised July, </month> <date> 1997.   In Machine Learning: Proceedings of the Thirteenth International Conference. 
cora	helmbold1996	 D. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth,   "On-line portfolio selection using multiplicative updates,"   1996,   in Proc. 13th International Conference on Machine Learning, 
cora	helmbold1996	 D. P. Helmbold, R. E. Schapire, Y. Singer, and M. K. War-muth.   On-line portfolio selection using multiplicative updates.   1996.   In Proc. of the Thirteenth Intl. Conf. on Machine Learning, 
cora	helmbold1996	 D. P. Helmbold, R. E. Schapire, Y. Singer, and M. K. War-muth.   On-line portfolio selection using multiplicative updates.   1996.   In Proc. of the Thirteenth Intl. Conf. on Machine Learning, 
cora	helmbold1996	 D. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth.   On-line portfolio selection using multiplicative updates.   1996.   In Proc. 13th International Conference on Machine Learning, 
cora	helmbold1996a	 Helmbold, D. P., Schapire, R. E., Singer, Y., and Warmuth, M. K.   A comparison of new and old algorithms for a mixture estimation problem,   (1996b),  
cora	helmbold1997	 Helmbold, D. P., & Schapire, R. E.   Predicting nearly as well as the best pruning of a decision tree.   (1997).   Machine Learning, 
cora	helmbold1997	 D.P. Helmbold and R.E. Schapire.   Predicting nearly as well as the best pruning of a decision tree.   1997.   Machine Learning, 
cora	helmbold1997c	 D.P. Helmbold, R.E. Schapire, Y. Singer, and M.K. Warmuth.   A comparison of new and old algorithms for a mixture estimation problem.   1997.   Machine Learning, 
cora	helmbold1997c	 D.P. Helmbold, R.E. Schapire, Y. Singer, and M.K. Warmuth.   A comparison of new and old algorithms for a mixture estimation problem.   1997.   Machine Learning, 
cora	helmbold1997c	 D. P. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth.   A comparison of new and old algorithms for a mixture estimation problem.   1997.   Machine Learning, 
cora	helmbold1997c	 D. P. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth.   A comparison of new and old algorithms for a mixture estimation problem.   1997.   Machine Learning, 
cora	helmbold1997c	 D. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth,   "A comparison of new and old algorithms for a mixture estimation problem,"   1997.   Machine Learning, 
cora	helmbold1997c	 D. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth.   A comparison of new and old algorithms for a mixture estimation problem.   1997.   Machine Learning, 
cora	kautz1993	 H. Kautz, M. Kearns, and B. Selman.   Reasoning with characteristic models.    In AAAI-93, 
cora	kautz1993	 Kautz, H. A., Kearns, M. J., & Selman.   B (1993). Reasoning with Characteristic Models.    In Proceedings of AAAI-1993, 
cora	kautz1993	 Kautz, H. A., Kearns, M. J., & Selman.   B (1993). Reasoning with Characteristic Models.    In Proceedings of AAAI-1993, 
cora	kautz1993	 Kautz, H., Kearns, M., and Selman, B.   Reasoning with characteristic models.   1993.   In Proc. of the National Conference on Artificial Intelligence (1993), 
cora	kautz1993	 Kautz, H., M. Kearns, and B. Selman.   Reasoning with characteristic models.   1993.   In Proceedings of the National Conference on Artificial Intelligence, 
cora	kautz1993	 Kautz, H.; Kearns, M.; and Selman, B.   Reasoning with characteristic models.   1993.   In Proceedings of the National Conference on Artificial Intelligence, 
cora	kautz1993	 H.A. Kautz, M.J. Kearns, B. Selman.   Reasoning with characteristic models.   1993.   Proceedings of AAAI, 
cora	kautz1993	 Kautz, Henry; Kearns, Michael; and Selman,   Bart 1993. Reasoning with characteristic models.    Technical report, 
cora	kautz1993	 H. Kautz, M. Kearns, and B. Selman,   Reasoning with characteristic models,    Proceedings AAAI-93 , Washington, 
cora	kautz1993	 H. Kautz, M. Kearns, and B. Selman.   Reasoning with characteristic models.   1993.   In Proceedings of the National Conference on Artificial Intelligence, 
cora	kautz1993	 H. A. Kautz, M. J. Kearns, and B. Selman.   Reasoning with characteristic models.    In Proceedings of the 11th National Conference on Artificial Intelligence, 
cora	kautz1995	 Kautz, H. A., Kearns, M. J., & Selman.   B (1995) Horn Approximations of Empirical Data.    Artificial Intelligence, 
cora	kautz1995	 Kautz, H. A., Kearns, M. J., & Selman.   B (1995) Horn Approximations of Empirical Data.    Artificial Intelligence, 
cora	kautz1995	 Kautz, H., Kearns, M., & Selman, B.   Horn approximations of empirical data.   (1995).   Artificial Intelligence, 
cora	kautz1995	 Kautz, H., Kearns, M., & Selman, B.   Horn approximations of empirical data.   (1995).   Artificial Intelligence, 
cora	kautz1995	 Kautz, H., Kearns, M., and Selman, B.   Horn approximations of empirical data.   (1995). </date> <i> Horn approximations of empirical data. </i> <venue> Artificial Intelligence, </venue> <volume> Vol. 74, </volume> <date> 1995,   Artificial Intelligence, 
cora	kautz1995	 Kautz, H., Kearns, M., and Selman, B.   Horn approximations of empirical data.   1995.   Artificial Intelligence 74, 
cora	kautz1995	 Kautz, H., M. Kearns, and B. Selman.   Horn approximations of empirical data.   1994.   Artificial Intelligence. Forthcoming. 
cora	kautz1995	 Kautz, H., M. Kearns, and B. Selman.   Horn approximations of empirical data.   1995.   Artificial Intelligence, 
cora	kautz1995	 Kautz, H.; Kearns, M.; and Selman, B.   Horn approximations of empirical data.   1994.   Artificial Intelligence. Forthcoming. 
cora	kautz1995	 H.A. Kautz, M.J. Kearns, B. Selman.   Horn Approximations of Empirical Data.   1994.   Artificial Intelligence, 
cora	kautz1995	 Henry A. Kautz, Michael J. Kearns, and Bart Selman.   Horn approximations of empirical data.   1994.   Artificial Intelligence, 
cora	kautz1995	 Kautz, Henry A.; Kearns, Michael J.; and Selman, Bart ppear.   Horn approximations of empirical data.    Artificial Intelligence. 
cora	kautz1995	 Henry A. Kautz, Michael J. Kearns and Bart Selman,   Horn approximations of Empirical Data,    Artif. Intell. 
cora	kautz1995	 H. Kautz, M. Kearns, and B. Selman.   Horn approximations of empirical data.   1994.   Artificial Intelligence, 
cora	kautz1995	 H. Kautz, M. Kearns and B. Selman.   Horn approximations of empirical data,    Artificial Intelligence, 
cora	kautz1995	 H. Kautz, M. Kearns, and B. Selman.   Horn approximations of empirical data.   1995.   Artificial Intelligence, 
cora	kautz1995	 H. Kautz, M. Kearns, and B. Selman.   Horn approximations of empirical data.   1995.   Artificial Intelligence, 
cora	kautz1995	 Henry Kautz, Michael Kearns, and Bart Selman.   Horn approximations of empirical data.   1995.   Artificial Intelligence, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. G. Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of boolean formu lae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1987	 Kearns, M. J., Li, M., Pitt, L., and Valiant, L.   On the learnability of boolean formulae.   1987a.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (STOC-87), 
cora	kearns1987	 Kearns, M. J., Li, M., Pitt, L., and Valiant, L.   On the learnability of boolean formulae.   1987a.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (STOC-87), 
cora	kearns1987	 Kearns, M. J., Li, M., Pitt, L., and Valiant, L.   On the learnability of boolean formulae.   1987a.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (STOC-87), 
cora	kearns1987	 Kearns, M., Li, M., Pitt, L., & Valiant, L.   On the learnability of Boolean formulae.   (1987).   Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (pp. 
cora	kearns1987	 Kearns, M., Li, M., Pitt, L., & Valiant, L.G.   On the learnability of Boolean formulae.   (1987).   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 Kearns, M., Li, M., Pitt, L., and Valiant, L.   On the learnability of Boolean formula.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing (pp. 
cora	kearns1987	 Kearns, M., Li, M., Pitt, L., and Valiant, L.   On the learnability of Boolean formula.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing (pp. 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L.   Valiant [1987]. "On the Learnability of Boolean Formul,"    Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L.G. Valiant,   On the learnability of boolean formulae.   1987,   Proceedings of the 19th Annual Symposium on the Theory of Computation, 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the 19th Symposium on the Theory of Computations, 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the 19th Symposium on the Theory of Computations, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant,   On the learnability of boolean formulae.    Proc. 19th ACM Symposium on Theory of Computing (1987) 285-295. 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the Learn-ability of Boolean Formulae.   1987.   In Proc. 19th STOC, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the Learn-ability of Boolean Formulae.   1987.   In Proc. 19th STOC, 
cora	kearns1987	 Michael Kearns, Ming Li, Lenny Pitt and Leslie G. Valiant.   On the learnability of Boolean formulae.   1987.   In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of Boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, L.G. Valiant.   On the learnability of Boolean formulae.   1987,   Proceedings of the 19th A.C.M. Symposium on the Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. G. Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 Kearns, M., Li, M., Pitt, L. & Valiant, L. G.   On the learnability of Boolean formulae.   (1987).   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (pp. 
cora	kearns1987	 Kearns, M., Li, M., Pitt, L., and Valiant, L.,   "On the learnability of Boolean formulae,"   1987,   Proc. of the 19th ACM Symp. Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. G. Valiant.   On the Learnability of Boolean Formulae.   1987.   In Proc. of the 19 th Annual ACM STOC, 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of Boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 M. J. Kearns, M. Li, L. Pitt, and L. Valiant,   On the learnability of boolean formula,   1987,"   in "Proceedings, 19th ACM Symposium on Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of boolean formulae.   1987.   In Proc. 19th ACM Symposium on Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L.G. Valiant.   On the learn-ability of Boolean formulae.   1987.   Proceedings of the 19th Annual Symposium on the Theory of Computation, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L.G. Valiant.   On the learn-ability of Boolean formulae.   1987.   Proceedings of the 19th Annual Symposium on the Theory of Computation, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, L.G. Valiant.   On the learnability of Boolean formulae.   1987,   Proceedings of the 19th A.C.M. Symposium on the Theory of Computing, 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of Boolean formulae.   1987.   In Proc. 19th Annu. ACM Sympos. Theory Comput., 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of Boolean formulae.   1987.   In Proc. 19th Annu. ACM Sympos. Theory Comput., 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant,   On the Learnability of Boolean Formulae,   1987.   in Proc. 19 th ACM Symposium on Theory of Computing, 
cora	kearns1987	 Kearns, M., M. Li, L. Pitt, L. Valiant,   "On the learnability of Boolean formulae",   1987,   19th ACM Symposium on the Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. G. Valiant.   On the learnability of boolean formulae.   1987.   In STOC-87, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. G. Valiant.   On the learnability of boolean formulae.   1987.   In STOC-87, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. G. Valiant.   On the learnability of boolean formulae.   1987.   In STOC-87, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of Boolean formulae.   1987.   In Proc. 19th Annu. ACM Sympos. Theory Comput., 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of Boolean formulae.   1987.   In Proc. 19th Annu. ACM Sympos. Theory Comput., 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of Boolean formulae.   1987,   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of boolean formulae.   1987.   In STOC-87, p. 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   On the learnability of boolean formulae.   1987.   In STOC-87, p. 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of Boolean formulae.   1987.   In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the 19th Symposium on the Theory of Computations, 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the 19th Symposium on the Theory of Computations, 
cora	kearns1987	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   On the learnability of boolean formulae.   1987.   In Proceedings of the 19th Symposium on the Theory of Computations, 
cora	kearns1987	 M. Kearns, M. Li, L. Pitt, L.G. Valiant.   On the learnability of Boolean formulae.   1987,   Proceedings of the 19th A.C.M. Symposium on the Theory of Computing, 
cora	kearns1987	 Kearns, M., M. Li, L. Pitt and L. Valiant,   On the Learnability of Boolean Formula,   1987.   Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 
cora	kearns1987b	 Kearns, M. J., Li, M., Pitt, L., and Valiant, L.   Recent results on boolean concept learning.   1987b.   In Proceedings of the Fourth International Conference on Machine Learning (ML-87), 
cora	kearns1987b	 Kearns, M. J., Li, M., Pitt, L., and Valiant, L.   Recent results on boolean concept learning.   1987b.   In Proceedings of the Fourth International Conference on Machine Learning (ML-87), 
cora	kearns1987b	 Kearns, M. J., Li, M., Pitt, L., and Valiant, L.   Recent results on boolean concept learning.   1987b.   In Proceedings of the Fourth International Conference on Machine Learning (ML-87), 
cora	kearns1987b	 Kearns, M., Li, M., Pitt, L., & Valiant, L. G.   Recent results on Boolean concept learning.   (1987).   Proceedings of the Fourth International Workshop on Machine Learning (pp. 
cora	kearns1987b	 Kearns, M., Li, M., Pitt, L., & Valiant, L. G.   Recent results on Boolean concept learning.   (1987).   Proceedings of the Fourth International Workshop on Machine Learning (pp. 
cora	kearns1987b	 M. Kearns, M. Li, L. Pitt, and L. Valiant.   Recent results on boolean concept learning.    Proceedings of the Fourth International Workshop on Machine Learning, 
cora	kearns1987b	 Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant.   Recent results on boolean concept learning.   1987.   In Proceedings of the Fourth International Workshop on Machine Learning, 
cora	kearns1987b	 M. Kearns, M. Li, L. Pitt, L.G. Valiant.   Recent results on Boolean concept learning.   1987,   Proceedings of the 4th International Workshop on Machine Learning, 
cora	kearns1988	 Kearns, M. J. and Li, M.   Learning in the presence of malicious errors.   (1988).   In Proceedings STOC-88. 
cora	kearns1988	 Kearns, M. J. and Li, M.   Learning in the presence of malicious errors.   (1988).   In Proceedings STOC-88. 
cora	kearns1988	 Kearns, M. J. and Li, M.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC-88), 
cora	kearns1988	 Kearns, M. J. and Li, M.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC-88), 
cora	kearns1988	 Kearns, M. J. and Li, M.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC-88), 
cora	kearns1988	 Kearns, M. and Li, M.   Learning in the presence of malicious errors.   1988. </date> <i> Learning in the presence of malicious errors. </i> <venue> In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (Chicago, </venue> <address> Illinois, </address> <month> May </month> <date> 1988),   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (Chicago, 
cora	kearns1988	 M. Kearns and M.   "Learning in the Presence of Malicious Errors,"   [1988].   Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago (1988), 
cora	kearns1988	 M. Kearns and M. Li,   Learning in the presence of malicious errors.   (1988).   Proceedings of the 20th ACM Symposium on the Theory of Computation, 
cora	kearns1988	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1988.   In Proc. 20th Annu. ACM Sympos. Theory Comput., 
cora	kearns1988	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1988.   In Proc. 20th Annu. ACM Sympos. Theory Comput., 
cora	kearns1988	 M. Kearns, M. Li,   Learning in the Presence of Malicious Errors,   
cora	kearns1988	 M. Kearns, M. Li.   Learning in the presence of malicious errors.   1988,   Proceedings of the 20th A.C.M. Symposium on the Theory of Computing, 
cora	kearns1988	 M. Kearns, and M. Li,   Learning in the Presence of Malicious Errors,    in: Proceedings of the 20th Annual ACM Symposium on the Theory of Computation, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the 20 th Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the 20 th Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Kearns, M., M. Li,   "Learning in the presence of malicious errors",   1988,   20th ACM Symposium on the Theory of Computing, 
cora	kearns1988	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1988.   In Proc. 20th Annu. ACM Sympos. Theory Comput., 
cora	kearns1988	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1988.   In Proc. 20th Annu. ACM Sympos. Theory Comput., 
cora	kearns1988	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1988.   Proceedings of the 20th ACM Symposium on the Theory of Computation, 
cora	kearns1988	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1988.   Proceedings of the 20th ACM Symposium on the Theory of Computation, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the 20 th Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1988.   In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 
cora	kearns1988b	 Michael Kearns.   Thoughts on hypothesis boosting.   1988.   (Unpublished), 
cora	kearns1988b	 Michael Kearns.   Thoughts on hypothesis boosting.   1988.   (Unpublished), 
cora	kearns1988b	 Kearns, M., L.G. Valiant,   "Learning Boolean formulae or finite automata is as hard as factoring",   1988.   technical report TR-14-88, 
cora	kearns1988b	 M. Kearns and L.G. Valiant.   Learning boolean formulae or finite automata is as hard as factoring.   1988.   Technical Report TR-14-88, 
cora	kearns1988b	 Michael Kearns and Leslie G. Valiant.   Learning boolean formulae or finite au tomata is as hard as factoring.   1988.   Technical Report TR 14-88, 
cora	kearns1988b	 M. Kearns and L.G. Valiant.   Learning boolean formulae or finite automata is as hard as factoring.   1988.   Technical Report TR-14-88, 
cora	kearns1989	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. Kearns and L. Valiant.   (1989) Cryptographic Limitations on Learning Boolean Formulae and Finite Automata.   
cora	kearns1989	 Kearns, M. & Valiant, L.   Cryptographic limitations on learning boolean for mulae and finite automata.   (1989).   In Proceedings of the 21st Annual ACM Symposium on Theory of Computing. 
cora	kearns1989	 Kearns, M. J. and Valiant, L. G.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing (STOC-89), 
cora	kearns1989	 Kearns, M. J. and Valiant, L. G.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing (STOC-89), 
cora	kearns1989	 Kearns, M. J. and Valiant, L. G.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing (STOC-89), 
cora	kearns1989	 Kearns, M. and Valiant, L. G.,   Cryptographic Limitations on Learning Boolean Formulae and Finite Automata,   1989.   In Proceedings of 21 st Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Kearns, M. and Valiant, L. G.,   Cryptographic Limitations on Learning Boolean Formulae and Finite Automata,   1989.   In Proceedings of 21 st Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Kearns, M., & Valiant, L.   Cryptographic limitations on learning boolean formulae and finite automata.   (1989).   In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Kearns, M., & Valiant, L. G.   Cryptographic Limitations on Learning Boolean Formulae and Finite Automata.   1989).   Pages 433-444 of: Proceedings of the 21 st Annual ACM Symposium on Theory of Computing. ACM, 
cora	kearns1989	 Kearns, M., & Valiant, L. G.   Cryptographic Limitations on Learning Boolean Formulae and Finite Automata.   1989).   Pages 433-444 of: Proceedings of the 21 st Annual ACM Symposium on Theory of Computing. ACM, 
cora	kearns1989	 Kearns, M., & Valiant, L. G.   Cryptographic Limitations on Learning Boolean Formulae and Finite Automata.   1989).   Pages 433-444 of: Proceedings of the 21 st Annual ACM Symposium on Theory of Computing. ACM, 
cora	kearns1989	 Kearns, M., and Valiant, L. G.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. Kearns and L. Valiant.   (1989) Cryptographic Limitations on Learning Boolean Formulae and Finite Automata.   
cora	kearns1989	 M. Kearns and L. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. Kearns and L. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Kearns, M., and Valiant, L.,   "Cryptographic Limitations on Learning Boolean Formulae and Finite Automata",    in: Proc. 21st Ann. ACM Symp. on Theory of Computing (1989) 433-444. 
cora	kearns1989	 M. Kearns and L. Valiant,   Cryptographic limitations on learning boolean formulae and finite automata.    Proc. 21st ACM Symposium on Theory of Computing (1989) 433-444. 
cora	kearns1989	 M. Kearns, L. Valiant,   Cryptographic limitations on learning Boolean formulae and finite automata,   
cora	kearns1989	 Michael Kearns and Leslie Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. Kearns and L. Valiant.   Cryptographic Limitations on Learning Boolean Formulae and Finite Automata.   1989.   In Proc. 21st STOC, 
cora	kearns1989	 M. Kearns and L. Valiant.   Cryptographic Limitations on Learning Boolean Formulae and Finite Automata.   1989.   In Proc. 21st STOC, 
cora	kearns1989	 Michael Kearns and Leslie G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Michael Kearns and Leslie G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Kearns, M. & Valiant, L. G.   Cryptographic limitations on learning boolean formulae and finite automata.   (1989).   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing (pp. 
cora	kearns1989	 Michael Kearns and Leslie G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Michael Kearns and Leslie G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. Kearns and L. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In Proceedings of the 21st ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. Kearns and L. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In Proc. 21st ACM Symposium on Theory of Computing, 
cora	kearns1989	 Michael Kearns and Leslie G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Michael Kearns and Leslie G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Michael Kearns and Leslie Valiant.   Cryptographic limitations on learning Boolean for-mulae and finite automata.   1989.   In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Michael Kearns and Leslie Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.    In Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Michael Kearns and Leslie G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 Kearns, M., and L. Valiant,   "Cryptographic limitations on learning Boolean formulae and finite automata".   (1989).   Proc. 21st STPC, 
cora	kearns1989	 Kearns, M., Valiant, L.G.,   Cryptographic Limitations on Learning Boolean For--mulae and Finite Automata,    Proc. 21 st ACM STOC (1989), 
cora	kearns1989	 M. Kearns and L. Valiant,   Cryptographic Limitations on Learning Boolean Formulae and Finite Automata,   1989.   in Proc 21 st ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and fi nite automata.   1989.   In Proceedings STOC-89, 
cora	kearns1989	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings STOC-89, 
cora	kearns1989	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings STOC-89, 
cora	kearns1989	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings STOC-89, 
cora	kearns1989	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings STOC-89, 
cora	kearns1989	 M. Kearns and L. G. Valiant.   Criptographic limitations on learning boolean formulae and finite automata.   1989.   In Proceedings of the 21th ACM Symposium on Theory and Computing, 
cora	kearns1989	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989.   In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In ACM Symposium on the Theory of Computing, 
cora	kearns1989	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. Kearns, L.G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1989,   34 Proceedings of the 21st A.C.M. Symposium on the Theory of Computing, 
cora	kearns1989	 Michael Kearns and Leslie Valient.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 
cora	kearns1989	 M. Kearns and L. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1989.   In 21st ACM Symposium on Theory of Computing, 
cora	kearns1989a	 M. Kearns and L. Pitt.   A polynomial-time algorithm for learning k-variable pattern languages from examples.   1989.   In Proceedings of the Second Annual Workshop on Computational Learning Theory, 
cora	kearns1989a	 M. Kearns, L. Pitt.   A polynomial-time algorithm for learning k-variable pattern languages from examples.   1989,   Proceedings of the 1989 Workshop on Computational Learning Theory, 
cora	kearns1989a	 M. Kearns, L. Pitt.   A polynomial-time algorithm for learning k-variable pattern languages from examples.   1989,   Proceedings of the 1989 Workshop on Computational Learning Theory, 
cora	kearns1990	 Michael J. Kearns.   The Computational Complexity of Machine Learning.   1990.  
cora	kearns1990	 Michael J. Kearns.   The Computational Complexity of Machine Learning.   1990.  
cora	kearns1990	 M. Kearns.   The Computational Complexity of Machine Learning.   (1990).  
cora	kearns1990	 Kearns, M. J.   The Computational Complexity of Machine Learning,   (1990).  
cora	kearns1990	 Michael J. Kearns.   The Computational Complexity of Machine Learning.   1990.  
cora	kearns1990	 Kearns, M.   The Computational Complexity of Machine Learning.   (1990).  
cora	kearns1990	 Michael Kearns.   The Computational Complexity of Machine Learning.   1990.  
cora	kearns1990	 Michael Kearns.   The Computational Complexity of Machine Learning.   1990.  
cora	kearns1990	 Michael Kearns.   The Computational Complexity of Machine Learning.   1990.  
cora	kearns1990	 Michael Kearns.   The Computational Complexity of Machine Learning.   1990.  
cora	kearns1990	 M. Kearns.   The Computational Complexity of Machine Learning.   1989.   PhD thesis, 
cora	kearns1990	 Kearns, M.   The Computational Complexity of Machine Learning.   (1990).  
cora	kearns1990	 Kearns, M.   The Computational Complexity of Machine Learning.   (1990).  
cora	kearns1990	 Michael J. Kearns.   The Computational Complexity of Machine Learning.   1990.  
cora	kearns1990	 Kearns, M.   The Computational Complexity of Machine Learning.   (1990.)  
cora	kearns1990	 Michael J. Kearns.   The Computational Complexity of Machine Learning.   1990.  
cora	kearns1990	 M. J. Kearns.   The Computational Complexity of Machine Learning.   1989.   ACM Distinguished Dissertation Series. 
cora	kearns1990	 M. J. Kearns.   The Computational Complexity of Machine Learning.   1989.   ACM Distinguished Dissertation Series. 
cora	kearns1990	 Kearns, M.   The Computational Complexity of Machine Learning.   (1990).  
cora	kearns1990	 M.J. Kearns.   The Computational Complexity of Machine Learning.   
cora	kearns1990	 M. Kearns.   The Computational Complexity of Machine Learning.   1989.   Doctoral dissertation, 
cora	kearns1990	 Michael Kearns.   The Computational Complexity of Machine Learning.   1989.   PhD thesis, 
cora	kearns1990	 Michael J. Kearns,   The Computational Complexity of Machine Learning,   1990.  
cora	kearns1990	 Kearns M. J.:   The Computational Complexity of Machine Learning,   1989  
cora	kearns1990b	 J. P. Kearns and J. E. Payne.   Performance Evaluation of Protocols for Distributed Systems: An Alternative to Message Counting.   1990.   In Proceedings of the Winter Simulation Conference, 
cora	kearns1990c	 M. Kearns and R. Schapire.   (1990) Efficient distribution-free learning of probabilistic concepts.    Proceedings of the 31st Annual Symposium on Foundations of Computer Science (pp. 
cora	kearns1990c	 Kearns, M. & Schapire, R.   Efficient distribution-free learning of probabilistic concepts.   (1990).   Proceedings of the 31st Annual Symposium on the Foundations of Computer Science (pp. 
cora	kearns1990c	 Kearns, M. J. & Schapire, R. E.   Efficient distribution-free learning of probabilistic concepts.   (1990).   31st Annual Symposium on Foundations of Computer Science (pp. 
cora	kearns1990c	 Kearns, M. J. and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proceedings of the Thirty-First Annual Symposium on Foundations of Computer Science, 
cora	kearns1990c	 Kearns, M. J. and Schapire, R. E.   Efficient distribution-free learning of probabilistic concepts.   (1990).   In Proceedings FOCS-90. 
cora	kearns1990c	 Kearns, M. J. and Schapire, R. E.   Efficient distribution-free learning of probabilistic concepts.   (1990).   In Proceedings FOCS-90. 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In 31st Annual Symposium on Foundations of Computer Science, 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire,   "Efficient Distribution-Free Learning of Probabilistic Concepts,"    Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (October 1990), 
cora	kearns1990c	 Michael J. Kearns and Robert E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In 31st Annual Symposium on Foundations of Computer Science, 
cora	kearns1990c	 Michael J. Kearns and Robert E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In 31st Annual Symposium on Foundations of Computer Science, 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 Michael J. Kearns and Robert E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In 31st Annual Symposium on Foundations of Computer Science, 
cora	kearns1990c	 Michael J. Kearns and Robert E. Schapire.   Efficient distribution-free learning of probablistic concepts.   1990.   In Proceedings of the Thirty-First Annual Symposium on Foundations of Computer Science, 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In 31st Annual Symposium on Foundations of Computer Science, 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proc. of the 31st Symposium on the Foundations of Comp. Sci., 
cora	kearns1990c	 M. J. Kearns and R. E. Shapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In FOCS-90, 
cora	kearns1990c	 M. J. Kearns and R. E. Shapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In FOCS-90, 
cora	kearns1990c	 M. J. Kearns and R. E. Shapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In FOCS-90, 
cora	kearns1990c	 M. J. Kearns and R. E. Shapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In FOCS-90, 
cora	kearns1990c	 M. J. Kearns and R. E. Shapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In FOCS-90, 
cora	kearns1990c	 M. Kearns and R. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In IEEE Symposium on the Foundations of Computer Science, 
cora	kearns1990c	 M. Kearns and R. Shapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In FOCS-90, 
cora	kearns1990c	 M. Kearns and R. Shapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In FOCS-90, 
cora	kearns1990c	 M. Kearns and R. Shapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In FOCS-90, 
cora	kearns1990c	 Michael J. Kearns and Robert E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proceedings of the Thirty-First Annual Symposium on Founda--tions of Computer Science, 
cora	kearns1990c	 Michael Kearns and Robert E. Shapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In Proceedings of the 31st Symposium on Foundation of Computer Science, 
cora	kearns1990c	 Michael Kearns and Robert Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   Proceedings of IEEE Symposium on Foundations of Computer Science, 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire,   "Efficient Distribution-Free Learning of Probabilistic Concepts,"    Proceedings of 31st Annual IEEE Symposium on Foundations of Computer Science (October 1990), 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire,   "Efficient Distribution-Free Learning of Probabilistic Concepts,"    Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (October 1990), 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire,   "Efficient Distribution-Free Learning of Probabilistic Concepts,"    Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (October 1990), 
cora	kearns1990c	 M. J. Kearns and R. E. Schapire,   "Efficient Distribution-Free Learning of Probabilistic Concepts,"    Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (October 1990), 
cora	kearns1990c	 Michael J. Kearns and Robert E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1990.   In 31st Annual Symposium on Foundations of Computer Science, 
cora	kearns1992a	 Kearns, M.   Oblivious pac learning of concepts hierarchies.   1992.   In Proc. of the National Conference on Artificial Intelligence (1992), 
cora	kearns1992a	 Kearns, M.   Oblivious pac learning of concepts hierarchies.   1992.   In Proceedings of the National Conference on Artificial Intelligence, 
cora	kearns1992a	 Kearns, M.   Oblivious pac learning of concepts hierarchies.   1992.   In Proceedings of the National Conference on Artificial Intelligence, 
cora	kearns1992c	 Kearns, M. J., R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In Proc. 5th Annu. Workshop on Comput. Learning Theory, 
cora	kearns1992c	 Kearns, M. J., Schapire, R. E., & Sellie, L. M.   Toward efficient agnostic learning.   (1992).   In Proceedings of the Fifth ACM Workshop on Computational Learning Theory, 
cora	kearns1992c	 Kearns, M. J., Schapire, R. E., & Sellie, L. M.   Toward efficient agnostic learning.   (1992).   In Proceedings of the Fifth ACM Workshop on Computational Learning Theory, 
cora	kearns1992c	 Kearns, M. J., Schapire, R. E., & Sellie, L. M.   Toward efficient agnostic learning.   (1992).   In Proceedings of the Fifth ACM Workshop on Computational Learning Theory, 
cora	kearns1992c	 Kearns, M. J., Schapire, R. E., and Sellie, L. M.   Toward efficient agnostic learning.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (1992), 
cora	kearns1992c	 Kearns, M.J., Schapire, R.E., and Sellie, L.M.   Toward efficient agnostic learning.   (1992).   In Proc. 5th Annu. Workshop on Comput. Learning Theory. 
cora	kearns1992c	 M. Kearns, R. Schapire, , and L. Sellie.   Toward efficient agnostic learning.    In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (COLT-92), 
cora	kearns1992c	 M. Kearns, R. Schapire, , and L. Sellie.   Toward efficient agnostic learning.    In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (COLT-92), 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992,   Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	kearns1992c	 Kearns, M., Schapire, R., and Sellie, L.   (1992) Toward efficient agnostic learning.    In Proc. 5th Ann. Workshop on Computational Learning Theory. 
cora	kearns1992c	 Kearns, M., Schapire, R., and Sellie, L.   (1992) Toward efficient agnostic learning.    In Proc. 5th Ann. Workshop on Computational Learning Theory. 
cora	kearns1992c	 Kearns, M., Schapire, R., and Sellie, L.   (1992) Toward efficient agnostic learning.    In Proc. 5th Ann. Workshop on Computational Learning Theory. 
cora	kearns1992c	 Michael J. Kearns, Robert E. Schapire, and Linda M. Sellie.   Toward efficient agnostic learning.   1992.   In Fifth Annual Workshop on Computational Learning Theory, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sallie,   Toward efficient agnostic learning,   1992,"   in "Proceedings of the 5th Annual Workshop on Computational Learning Theory, 
cora	kearns1992c	 Michael J. Kearns, Robert E. Schapire, and Linda M. Sellie.   Toward efficient agnostic learning.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	kearns1992c	 M. Kearns, R. Schapire and L. Sellie,   Towards efficient agnostic learning.   1992.  
cora	kearns1992c	 M. Kearns, R. Schapire and L. Sellie,   Towards efficient agnostic learning.   1992.  
cora	kearns1992c	 M. Kearns, R. Schapire and L. Sellie,   Towards efficient agnostic learning.   1992.  
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In 5th COLT, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In 5th COLT, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In 5th COLT, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic leaning.   1992.   In Proceedings COLT-92, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic leaning.   1992.   In Proceedings COLT-92, 
cora	kearns1992c	 M.J. Kearns, R.E. Schapire and L.M. Sellie,   "Toward agnostic learning".    Proc. 5th Ann. Workshop on Computational Learning Theory, 
cora	kearns1992c	 M.J. Kearns, R.E. Schapire and L.M. Sellie,   "Toward agnostic learning".    Proc. 5th Ann. Workshop on Computational Learning Theory, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In Proc. 5th Annu. Workshop on Comput. Learning Theory, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In Proc. 5th Annu. Workshop on Comput. Learning Theory, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In Proceedings of the 5th Annual Workshop on Computational Learning Theory, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In Proceedings of the 5th Annual Workshop on Computational Learning Theory, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, L. M. Sellie,   Toward efficient agnostic learning,    Proc. of the 5th ACM Workshop on Computational Learning Theory, 1992, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic leaning.   1992.   In Proceedings COLT-92, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In Proc. 5th Annu. Workshop on Comput. Learning Theory, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In Proc. 5th Workshop on Computational Learning Theory, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1992.   In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 
cora	kearns1992c	 M. Kearns, E. Schapire and L. Sellie,   Toward Efficient Agnostic Learning.    Proc. of 5th Annual ACM Conference on Computational Learning Theory (1992) 341-352. 
cora	kearns1992c	 M. Kearns, R.E. Schapire, and L.M. Sellie.   Toward efficient agnostic learning.   1992.   In ACM Workshop on Computational Learning Theory, 
cora	kearns1992c	 M. J. Kearns, R. E. Schapire, and L. M. Sel-lie.   Toward efficient agnostic learning.    In Proc. 5th Annual Workshop on Computational Learning Theory. 
cora	kearns1992c	 M. Kearns, R.E. Schapire and L.M. Sellie,   Toward efficient agnostic learning.    5th ACM Workshop on Computational Learning Theory (1992) 341-352. 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM Journal on Computing, 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the precence of malicious error.   1993.   Siam Journal of Computing, 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   (1993).   Siam Journal on Computing, 
cora	kearns1993a	 Kearns, M. & Li, M.   Learning in the presence of malicious errors.   (1993).   SIAM Journal on Computing, 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1993.   SIAM Journal on Computing, 
cora	kearns1993a	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1993.   SIAM Journal on Computing, 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.    SIAM Journal on Computing, 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.    SIAM Journal on Computing, 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.    SIAM Journal on Computing, 
cora	kearns1993a	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1993.   SIAM Journal on Computing, 
cora	kearns1993a	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1993.   SIAM Journal on Computing, 
cora	kearns1993a	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1993.   SIAM Journal on Computing, 
cora	kearns1993a	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1993.   SIAM Journal on Computing, 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1993.   SIAM Journal on Computing, 
cora	kearns1993a	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1993.   SIAM Journal on Computing, 
cora	kearns1993a	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1993.   SIAM Journal on Computing, 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns and M. Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993a	 M. Kearns, M. Li,   Learning in the presence of malicious errors,   1993,   SIAM J. Comput., 
cora	kearns1993a	 Michael Kearns and Ming Li.   Learning in the presence of malicious errors.   1993.   SIAM J. Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M.J. Kearns.   Efficient noise-tolerant learning from statistical queries.    In Proc. 25th ACM Symp. on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   (1993).   Proceedings of the 25th Annual ACM Symposium on Theory of Computing (pp. 
cora	kearns1993b	 M.J. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   Proceedings of the 25th ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 Kearns, M.   Efficient noise-tolerant learning from statistical queries,   (1993),   in Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, ACM, 
cora	kearns1993b	 Kearns, M.   Efficient noise-tolerant learning from statistical queries.   (1993).   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 Kearns, M.   Efficient noise-tolerant learning from statistical queries.   (1993).   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 Kearns, M.   Efficient noise-tolerant learning from statistical queries.   (1993).   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 Kearns, M.   Efficient noise-tolerant learning from statistical queries.   (1993).   Proceedings of the 25th Annual ACM Symposium on Theory of Computing (pp. 
cora	kearns1993b	 Kearns, M.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput. (1993). 
cora	kearns1993b	 Kearns, M. J.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing (STOC-93), 
cora	kearns1993b	 Kearns, M. J.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing (STOC-93), 
cora	kearns1993b	 Kearns, M. J.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing (STOC-93), 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns,   Efficient Noise-Tolerant Learning from Statistical Queries,   
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 Michael J. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In 25th STOC, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sym-pos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sym-pos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sym-pos. Theory Comput., 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the 25 th Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the 25 th Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   STOC, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   STOC, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   STOC, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M.J. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 M.J. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 Micahel Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 Micahel Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 Michael J. Kearns and H. Sebastian Seung.   Learning from a population of hy potheses.   1993.   In Proceedings of COLT '93, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. J. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 M. J. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the 25 th Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the 25 th Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 M. J. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns,   Efficient noise-tolerant learning from statistical queries,    Proc. of the 25th ACM Symp. on the Theory of Computing, 1993, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. 25th Annu. ACM Sympos. Theory Comput., 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. STOC-93, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. STOC-93, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. STOC-93, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. STOC-93, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proc. STOC-93, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the 25 th Annual ACM Symposium on the Theory of Computing, 
cora	kearns1993b	 Michael Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1993b	 Kearns, M.   Efficient Noise-Tolerant Learning from Statistical Queries.   1993.   In Proc. 25th Annual ACM Symp. Theory of Computing, 
cora	kearns1993b	 M. Kearns.   Efficient noise-tolerant learning from statistical queries.   1993.   In Proceedings of the 25th ACM Symp. on Theory of Computing, 
cora	kearns1993c	 Michael J. Kearns and H. Sebastian Seung.   Learning from a population of hypotheses.   1993.   In Proceedings of COLT '93, 
cora	kearns1993c	 Michael J. Kearns and H. Sebastian Seung.   Learning from a population of hypotheses.   1993.   In Proceedings of COLT '93, 
cora	kearns1994a	 M. Kearns, Y.Mansour, D. Ron, R. Rubinfeld, R.E. Schapire, and L. Sellie.   On the learnabil-ity of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. Kearns, Y.Mansour, D. Ron, R. Rubinfeld, R.E. Schapire, and L. Sellie.   On the learnabil-ity of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 Kearns, M. J., Mansour, Y., Ron, D., Rubinfeld, R., Schapire, R. E., and Sellie, L.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing (1994), 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, L. Sellie,   On the Learnability of Discrete Distributions,   1994.   The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, L. Sellie,   On the Learnability of Discrete Distributions,   1994.   The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 Michael Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, and Linda Sellie.   On the learnability of discrete distributions (extended abstract).   1994.   Proc. of the 26th Ann. ACM Symp. on Theory of Computing, 
cora	kearns1994a	 Michael Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, and Linda Sellie.   On the learnability of discrete distributions (extended abstract).   1994.   Proc. of the 26th Ann. ACM Symp. on Theory of Computing, 
cora	kearns1994a	 M. J. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. J. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. J. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire and L. Sellie.   On the Learnability of Discrete Distributions,   1994.   STOC, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire and L. Sellie.   On the Learnability of Discrete Distributions,   1994.   STOC, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire and L. Sellie.   On the Learnability of Discrete Distributions,   1994.   STOC, 
cora	kearns1994a	 M. J. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. J. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. J. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire and L. Sellie.   On the Learnability of discrete distributions.   1994.   STOC 94, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire and L. Sellie.   On the learnability of discrete distributions.   1994.   STOC 94, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In Proceedings of the 26th ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In Proceedings of the 26th ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symp. on Theory of Computing, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symp. on Theory of Computing, 
cora	kearns1994a	 M. Kearns, Y.Mansour, D. Ron, R. Rubinfeld, R.E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symp. on Theory of Computing, 
cora	kearns1994a	 M. Kearns, Y.Mansour, D. Ron, R. Rubinfeld, R.E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing (to appear), 
cora	kearns1994a	 M. J. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In The 25th Annual ACM Symposium on Theory of Computing, 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Ru-binfeld, R. Schapire, and L. Sellie.   On the learnabil-ity of discrete distributions.   1994.   In STOC, p. 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Ru-binfeld, R. Schapire, and L. Sellie.   On the learnabil-ity of discrete distributions.   1994.   In STOC, p. 
cora	kearns1994a	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie.   On the learnability of discrete distributions.   1994.   In ACM Symposium on the Theory of Computing, 
cora	kearns1994b	 M. J. Kearns and U. V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M.J. Kearns and U.V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Kearns, M. & Vazirani, U.   An Introduction to Computational Learning Theory,   (1994),  
cora	kearns1994b	 Kearns, M. & Vazirani, U.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. & Vazirani, U.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J. & Vazirani, U. V.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J. & Vazirani, U. V.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J. & Vazirani, U. V.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J. & Vazirani, U. V.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J. & Vazirani, U. V.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J., & Vazirani, U. V.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J., & Vazirani, U. V.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J., & Vazirani, U. V.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J., & Vazirani, U. V.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J., & Vazirani, U. V.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M. J., & Vazirani, U. V.   An introduction to computational learning theory.   (1994).  
cora	kearns1994b	 Kearns, M. J., & Vazirani, U. V.   An introduction to computational learning theory.   (1994).  
cora	kearns1994b	 Kearns, M. J., & Vazirani, U. V.   An introduction to computational learning theory.   (1994).  
cora	kearns1994b	 Kearns, M. J., & Vazirani, U. V.   An introduction to computational learning theory.   (1994).  
cora	kearns1994b	 Kearns, M. J., & Vazirani, U. V.   An introduction to computational learning theory.   (1994).  
cora	kearns1994b	 Kearns, M., & Vazirani, U.   An Introduction to Computational Learning Theory.   (1994).  
cora	kearns1994b	 Kearns, M., and Vazirani, U.   Introduction to computational Learning Theory.   1992.  
cora	kearns1994b	 Kearns, Michael, and Umesh Vazirani.   An introduction to computational learning theory.   1994.  
cora	kearns1994b	 M. Kearns & U. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael Kearns and Umesh Vazarani.   An introduction to computational learning theory.   1994.  
cora	kearns1994b	 M. Kearns & U. Vazirani.   An introduction to computational learning theory.   1994.  
cora	kearns1994b	 M. Kearns & U. Vazirani.   An introduction to computational learning theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M.J. Kearns and U.V. Vazirani.   An Introduction to Computational Learning Theory,   1994.  
cora	kearns1994b	 M. J. Kearns and U. V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. J. Kearns and U. V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. J. Kearns and U. V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh Virkumar Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh Virkumar Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh Virkumar Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh Virkumar Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh Virkumar Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh Virkumar Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh Virkumar Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh Virkumar Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh Virkumar Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Kearns, M. and Vazirani, U.   Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Kearns, M. and Vazirani, U.   Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Kearns, M. and Vazirani, U.   Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. J. Kearns and U. V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. Kearns and U. Vazirani.   An Introduction to Computational Learning Theory.    57-62. 
cora	kearns1994b	 M. Kearns and U. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. Kearns and U. Vazirani.   An introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Michael J. Kearns and Umesh V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M.J. Kearns and U.V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M.J. Kearns and U.   Vazirani (1995). Introduction to Computational Learning Theory,   
cora	kearns1994b	 M.J. Kearns and U.   Vazirani (1995). Introduction to Computational Learning Theory,   
cora	kearns1994b	 M. J. Kearns and U. V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. J. Kearns and U.V. Vazirani.   An introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. J. Kearns and U.V. Vazirani.   An introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M J Kearns and U V Varizani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. J. Kearns and U. V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. J. Kearns and U. V. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. Kearns and U. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. Kearns and U. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. Kearns and U. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. Kearns and U. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. Kearns and U. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 M. Kearns and U. Vazirani.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Kearns, M. J., and Vazirani, U. V.   An Introduction to Computational Learning Theory.   1994.  
cora	kearns1994b	 Kearns, M.J. & Vazirani, U.V.   An Introduction to Computational Learning Theory,   (1994).   chp. 
cora	kearns1994b	 Kearns, M.J. & Vazirani, U.V.   An Introduction to Computational Learning Theory,   (1994).   chp. 
cora	kearns1994b	 Kearns, M.J. & Vazirani, U.V.   An Introduction to Computational Learning Theory,   (1994).   chp. 
cora	kearns1994b	 Kearns, M. and Vazirani, U.   An introduction to computational learning theory.   1994.  
cora	kearns1994c	 M.J. Kearns and R.E. Schapire.   Efficient distribution-free probabilistic concepts.   1994.  
cora	kearns1994c	 M.J. Kearns and R.E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences, 
cora	kearns1994c	 Kearns, M. J., and Schapire, R. E.   Efficient Distribution-Free Learning of Probabilistic Concepts.   (1994).   JCSS 48(3): 
cora	kearns1994c	 Kearns, M., and Schapire, R.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences 48 
cora	kearns1994c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences, 
cora	kearns1994c	 M. Kearns and R. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences, 
cora	kearns1994c	 M. Kearns and R. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences, 
cora	kearns1994c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences, 
cora	kearns1994c	 M. Kearns and R.E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and Systems Sciences, </venue> <volume> 48(3) </volume> <pages> 464-497, </pages> <date> 1994. </date> <venue> An extended abstract appeared in the Proceedings of the 30th Annual Symposium on the Foundations of Computer Science. 
cora	kearns1994c	 M. Kearns and R. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences, 
cora	kearns1994c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences, 
cora	kearns1994c	 M. J. Kearns and R. E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences, 
cora	kearns1994c	 M. Kearns and R. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   J. of Comput. Syst. Sci., 
cora	kearns1994c	 Michael J. Kearns and Robert E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences, 
cora	kearns1994c	 Michael J. Kearns and Robert E. Schapire.   Efficient distribution-free learning of probabilistic concepts.   1994.   Journal of Computer and System Sciences, 
cora	kearns1994cryp	 M. Kearns and L. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   (1994).   Journal of the Association for Computing Machinery, 
cora	kearns1994cryp	 Kearns, M. & Valiant, L. G.   Cryptographic limitations on learning Boolean formulae and finite automata.   (1994).   Journal of the ACM, 
cora	kearns1994cryp	 Kearns, M. & Valiant, L. G.   Cryptographic limitations on learning Boolean formulae and finite automata.   (1994).   Journal of the Association for Computing Machinery, 
cora	kearns1994cryp	 Kearns, M. & Valiant, L.G.   Cryptographic limitations on learning Boolean formulae and finite automata.   (1994).   Journal of the ACM, 
cora	kearns1994cryp	 Kearns, M. J., and Valiant, L.   Cryptographic limitations on learning boolean formulae and finite automata.   (1994).   J. of the Assoc. Computing Mach. 
cora	kearns1994cryp	 Kearns, M.J. and L.G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the ACM, 
cora	kearns1994cryp	 M. Kearns and L.G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the ACM, 
cora	kearns1994cryp	 M. Kearns and L.G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the ACM, 
cora	kearns1994cryp	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1994.   Journal of the ACM, 
cora	kearns1994cryp	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1994.   Journal of the ACM, 
cora	kearns1994cryp	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1994.   Journal of the ACM, 
cora	kearns1994cryp	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	kearns1994cryp	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	kearns1994cryp	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	kearns1994cryp	 M. Kearns and L. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	kearns1994cryp	 Michael Kearns and Leslie G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	kearns1994cryp	 M. Kearns and L. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	kearns1994cryp	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   J. ACM, 
cora	kearns1994cryp	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   J. ACM, 
cora	kearns1994cryp	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   J. ACM, 
cora	kearns1994cryp	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   J. ACM, 
cora	kearns1994cryp	 M. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   J. ACM, 
cora	kearns1994cryp	 M. Kearns and L. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1994.   Journal of ACM, 
cora	kearns1994cryp	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning boolean formula and finite automata.   1994.   Journal of the ACM, 
cora	kearns1994cryp	 M. Kearns and L. Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1994.   Journal of the ACM, 
cora	kearns1994cryp	 M.J. Kearns and L.G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the ACM 41(1): 
cora	kearns1994cryp	 M.J. Kearns and L.G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the ACM 41(1): 
cora	kearns1994cryp	 Michael Kearns and Leslie Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1994.   Journal of the ACM, 
cora	kearns1994cryp	 Kearns and Valiant.   Cryptographic limitations on learning boolean formulae and finite automata.   1994.   Journal of the ACM, 
cora	kearns1994cryp	 M. J. Kearns and L. G. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	kearns1994cryp	 M. Kearns and L. Valiant.   Cryptographic limitations on learning Boolean formulae and finite automata.   1994.   J. ACM, 
cora	kearns1994d	 M. Kearns, R. Schapire, and L. Sellie.   Toward efficient agnostic learning.    Machine Learning, 
cora	kearns1994d	 M. Kearns, R. Schapire, and L. Sellie.   Toward efficient agnostic learning.    Machine Learning, 
cora	kearns1994d	 M. Kearns, R. Schapire, and L. Sellie.   Toward efficient agnostic learning.    Machine Learning, 
cora	kearns1994d	 M. Kearns, R. Schapire, and L. Sellie.   Toward efficient agnostic learning.    Machine Learning, 
cora	kearns1994d	 Kearns, M. J., Schapire, R. E., and Sellie, L. M.   Toward efficient agnostic learning,   (1994),   Machine Learning 17, 
cora	kearns1994d	 Kearns, M. J., Schapire, R. E., and Sellie, L. M.   Toward efficient agnostic learning,   (1994b),   Machine Learning 17, 
cora	kearns1994d	 M. Kearns, R. Schapire, and L. Sellie.   Toward efficient agnostic learning.   1994.   Machine Learning, 
cora	kearns1994d	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1994.   Machine Learning, 
cora	kearns1994d	 M. Kearns, R. Schapire, and L. Sellie.   Toward efficient agnostic learning.    Machine Learning, 
cora	kearns1994d	 M. Kearns, R. Schapire, and L. Sellie.   Toward efficient agnostic learning.    Machine Learning, 
cora	kearns1994d	 M. Kearns, R. Schapire, and L. Sellie.   Toward efficient agnostic learning.    Machine Learning, 
cora	kearns1994d	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1994.   Machine Learning, 
cora	kearns1994d	 M. J. Kearns, R. E. Schapire, and L. M. Sellie.   Toward efficient agnostic learning.   1994.   Machine Learning, 
cora	kearns1994d	 Michael J. Kearns, Robert E. Schapire, and Linda M. Sellie.   Toward efficient agnostic learning.    Machine Learning, 
cora	kearns1994d	 M. Kearns, R. Schapire, and L. Sellie.   Toward efficient agnostic learning.   1994.   Machine Learning, 
cora	kearns1994d	 Michael J. Kearns, Robert E. Schapire, and Linda M. Sellie.   Toward efficient agnostic learning.    Machine Learning, 
cora	kearns1994d	 Michael J. Kearns, Robert E. Schapire, and Linda M. Sellie.   Toward efficient agnostic learning.   1994.   Machine Learning, 
cora	kearns1994d	 Michael J. Kearns, Robert E. Schapire, and Linda M. Sellie.   Toward efficient agnostic learning.   1994.   Machine Learning, 
cora	kearns1994e	 Kearns, M., Li, M., and Valiant, L.   Learning Boolean formulas,   (1994a),   ACM 41, 
cora	kearns1994e	 M. Kearns, M. Li, and L. Valiant.   Learning Boolean formulas.   1994.   Journal of the ACM, 
cora	kearns1994e	 M. Kearns, M. Li, and L. Valiant.   Learning boolean formulae.   1995.   Journal of the Association for Computing Machinery, 
cora	kearns1994e	 M. Kearns, M. Li and L. Valiant.   Learn ing boolean formulas.   1994.   Journal of the ACM, 
cora	kearns1994f	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie.   Efficient Learning of Typical Finite Automata from Random Walks.   1994.   In Proc. 26th STOC, 
cora	kearns1994f	 M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie.   Efficient Learning of Typical Finite Automata from Random Walks.   1994.   In Proc. 26th STOC, 
cora	kearns1995a	 Kearns, M. & H.S.   Seung (1995), Learning from a Population of Hypotheses,    Machine Learning, 
cora	kearns1995a	 M. Kearns and H. S.   Seung (1995). Learning from a Population of Hypotheses,    Machine Learning, 
cora	kearns1995a	 M. Kearns and H. Seung.   Learning from a population of hypotheses.   1995.   Machine Learning, 
cora	kearns1995b	 Kearns, M.; Mansour, Y.; Ng, A.; and Ron, D.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings COLT-95. 
cora	kearns1995b	 Kearns, M.; Mansour, Y.; Ng, A.; and Ron, D.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings COLT-95. 
cora	kearns1995b	 Kearns, M.; Mansour, Y.; Ng, A.; and Ron, D.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings COLT-95. 
cora	kearns1995b	 Kearns, M.; Mansour, Y.; Ng, A.; and Ron, D.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings COLT-95. 
cora	kearns1995b	 Kearns, M.; Mansour, Y.; Ng, A.; and Ron, D.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings COLT-95. 
cora	kearns1995b	 Kearns, M.; Mansour, Y.; Ng, A.; and Ron, D.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings COLT-95. 
cora	kearns1995b	 M. J. Kearns, Y. Mansour, A. Ng, , and D. Ron.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings of the Eighth Annual ACM Workshop on Computational Learning Theory, 
cora	kearns1995b	 Michael Kearns, Yishay Mansour, Andrew Y. Ng, and Dana Ron.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings of the Eighth Annual Conference on Computational Learning Theory, 
cora	kearns1995b	 M. Kearns, Y. Mansour, A. Y. Ng, and D. Ron.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings of the Eighth Annual Conference on Computational Learning Theory, 
cora	kearns1995b	 M. Kearns, Y. Mansour, A. Ng, and D. Ron.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings of the Eigth Annual ACM Conference on Computational Learning Theory, 
cora	kearns1995b	 M. Kearns, Y. Mansour, A. Ng, and D. Ron.   An experimental and theoretical comparison of model selection methods.   1995.   In COLT-95, 
cora	kearns1995b	 M. Kearns, Y. Mansour, A. Y. Ng and D. Ron,   "An Experimental and Theoretical Comparison of Model Selection Methods",    in Proceedings of the seventh workshop on Computational Learning Theory", 
cora	kearns1995b	 M. J. Kearns, Y. Mansour, A. Ng, , and D. Ron.   An experimental and theoretical comparison of model selection methods.   1995.   In Proceedings of the Eighth Annual ACM Workshop on Computational Learning Theory, 
cora	kearns1995b	 M. Kearns, Y. Mansour, A. Y. Ng, and D. Ron.   An experimental and theoretical comparison of model selection methods.   1995.   In Proc. of the Workshop on Computational Learning Theory, 
cora	kearns1995b	 Kearns, M. J., Mansour, Y., Ng, A. Y., and Ron, D.   An experimental and theoretical comparison of model selection methods.   (1995).   In Proceedings of the Eighth ACM Conference on Computational Learning Theory, 
cora	kearns1995b	 Kearns, M. J., Mansour, Y., Ng, A. Y., and Ron, D.   An experimental and theoretical comparison of model selection methods.   (1995).   In Proceedings of the Eighth ACM Conference on Computational Learning Theory, 
cora	kearns1995b	 Kearns, M. J., Mansour, Y., Ng, A. Y., and Ron, D.   An experimental and theoretical comparison of model selection methods.   (1995).   In Proceedings of the Eighth ACM Conference on Computational Learning Theory, 
cora	kearns1996a	 Kearns, M.   "A Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with Consequences for Training-Test Split", Neural Information Processing 8,   (1996).  
cora	kearns1996a	 Kearns, M.   A bound on the error of cross validation using the approximation and estimation rates, with consequences for the training-test split.   (1996).   Advances in Neural Information Processing Systems, number 8 in NIPS. 
cora	kearns1996a	 Kearns, M.,   `A bound on the error of cross validation using the approximation and estimation rates, with consequences for the training-test split,'   1996.   in Advances in Neural Information Processing 8, 
cora	kearns1996a	 Kearns, M. J.   A bound on the error of Cross Validation using the approximation and estimation rates, with consequences for the training-test split.   (1996).   In Advances in Neural Information Processing Systems 8, 
cora	kearns1996a	 M. Kearns.   A bound on the error of cross validation, with consequences for the training-test split.   1996.   In Advances in Neural Information Processing Systems 8, 
cora	kearns1996a	 Michael Kearns.   A bound on the error of cross validation using the approximation and estimation rates, with consequences for the training-test split.   1996.   In Advances in Neural Information Processing Systems, 
cora	kearns1996a	 M. Kearns.   A bound on the error of cross validation, with consequences for the training-test split.   1996.   In Advances in Neural Information Processing Systems 8. 
cora	kearns1996a	 M. Kearns.   A bound on the error of cross validation, with consequences for the training-test split.   1996.   In Advances in Neural Information Processing Systems 8. 
cora	kearns1996a	 M. Kearns.   A bound on the error of cross validation, with consequences for the training--test split.   1996.   In Advances in Neural Information Processing Systems 8, 
cora	kearns1996a	 Kearns, M. J.   A bound on the error of Cross Validation using the approxima-tion and estimation rates, with consequences for the training-test split.   (1996).   In Advances in Neural Information Processing Systems 8, 
cora	kearns1996a	 Kearns, M. J.   A bound on the error of Cross Validation using the approximation and estimation rates, with consequences for the training-test split.   (1996).   In Advances in Neural Information Processing Systems 8, 
cora	kearns1996a	 Kearns, M. J.   A bound on the error of Cross Validation using the approximation and estimation rates, with consequences for the training-test split.   (1996).   In Advances in Neural Information Processing Systems 8, 
cora	kearns1996b	 Kearns, M. and Y.   Mansour (1996). On the boosting ability of top-down decision tree learning algorithms.    To appear in Proceedings of the 28th ACM Symposium on the Theory of Computing. 
cora	kearns1996b	 Kearns, M. and Y.   Mansour (1996). On the boosting ability of top-down decision tree learning algorithms.    To appear in Proceedings of the 28th ACM Symposium on the Theory of Computing. 
cora	kearns1996b	 Michael Kearns and Yishay Mansour.   On the boosting ability of top-down decision tree learning algorithms.   1996.   In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1996b	 Michael Kearns and Yishay Mansour.   On the boosting ability of top-down decision tree learning algorithms.   1996.   In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1996b	 Michael Kearns and Yishay Mansour.   On the boosting ability of top-down decision tree learning algorithms.   1996.   In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 
cora	kearns1996b	 M. Kearns and Y. Mansour.   On the boosting ability of top-down decision tree learning algorithms.   1996.   In Proceedings of the 28th ACM Symposium on the Theory of Computing, 
cora	kearns1996b	 Michael Kearns and Yishay Mansour.   On the Boosting Ability of Top-Down Decision Tree Learning Algorithms.   1996.   Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 
cora	kearns1997a	 Kearns, M., Mansour, Y., Ng, A. Y., & Ron, D.   An experimental and theoretical comparsion of model selection methods.   (1997).   Machine Learning, 
cora	kearns1997a	 Kearns, M., Mansour, Y., Ng, A., and Ron, D.   An experimental and theoretical comparison of model selection methods.   (1997).   Machine Learning, 
cora	kearns1997a	 Kearns, M. J. and Ron, D.   Algorithmic stability and sanity-check bounds for leave-one-out cross-validation.   (1997).   In Proceedings of the Tenth Annual Conference on Computational Learning Theory. 
cora	kearns1997a	 Kearns, M. J., Mansour, Y., Ng, A. Y., and Ron, D.   An experimental and theoretical comparison of model selection methods.   (1997).   Machine Learning Journal, 
cora	kearns1997a	 M. Kearns, Y. Mansour, A. Ng, and D. Ron.   An experimental and theoretical comparison of model selection methods.   1997.   In Machine Learning 27: 
cora	kearns1997a	 M. Kearns, Y. Mansour, A. Ng, D. Ron.   An Experimental and Theoretical Comparison of Model Selection Methods.   1997.   Machine Learning, 
cora	kearns1997b	 M. Kearns, Y. Mansour, A. Ng,   "An information-theoretic analysis of hard and soft assignment methods for clustering,"   1997.   Proc. 13th Conference on Uncertainty in Artificial Intelligence, 
cora	kearns1997b	 M. Kearns, Y. Mansour, A. Ng,   "An information-theoretic analysis of hard and soft assignment methods for clustering,"   1997.   Proc. 13th Conference on Uncertainty in Artificial Intelligence, 
cora	kearns1997b	 M. Kearns, Y. Mansour, A. Ng.   "An information--theoretic analysis of hard and soft assignment methods for clustering,"   1997.   Proc. 13th Conference on Uncertainty in Artificial Intelligence, 
cora	kearns1997b	 M. Kearns, Y. Mansour, and A. Y. Ng.   An information-theoretic analysis of hard and soft assignment methods for clustering.   1997.   In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 
cora	kearns1997b	 M. Kearns, Y. Mansour, and A. Y. Ng.   An information-theoretic analysis of hard and soft assignment methods for clustering.   1997.   In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 
cora	kearns1997b	 Kearns, M., Mansour, Y., and Ng, A. Y.   An information-theoretic analysis of hard and soft assignment methods for clustering.    In Proceedings of the Thirteenth Annual Conference on Uncertainty in Artificial Intelligence (1997), 
cora	kearns1998	 Kearns, M. and Ron, D.   Testing problems with sub-learning sample complexity.   1998.   To appear in Proceedings of the Eleventh Annual ACM Conference on Computational Learning Theory. 
cora	kearns1998	 M. Kearns and D. Ron.   Testing problems with sub-learning sample complexity.   1998.   Manuscript, 
cora	kearns1999a	 Michael Kearns and Satinder Singh.   Finite-sample convergence rates for Q-learning and indirect algorithms.   1999.   In Neural Information Processing Systems 12. 
cora	kearns1999b	 M. Kearns, Y. Mansour, and A. Ng.   A sparse sampling algorithm for near-optimal planning in large Markov decision processes. 1999.    Unpublished manuscript. 
cora	lewis1996	 D. D. Lewis, R. E. Schapire, J. P. Callan, and R. Papka.   Training algorithms for linear classifiers.   1996.   In Proc. of the 19th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 Lewis, D. D., Schapire, R. E., Callan, J. P., & Papka, R.   Training algorithms for linear text classifiers.   (1996).   Proceedings of the Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 
cora	lewis1996	 Lewis, D. D., Schapire, R. E., Callan, J. P., & Papka, R.   Training algorithms for linear text classifiers.   (1996).   Proceedings of the Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 
cora	lewis1996	 Lewis, D., R. E. Schapire, J. P. Callan, and R. Papka.   Training algorithms for linear text classifiers.   1996. </date> <i> Training algorithms for linear text classifiers. </i> <venue> In SIGIR '96: Proc. of the 19th Int. Conference on Research and Development in Information Retrieval, </venue> <date> 1996.   In SIGIR '96: Proc. of the 19th Int. Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 Lewis, D.; Schapire, R. E.; Callan, J. P.; and Papka, R.   Training algorithms for linear text classifiers.   1996.   In Proc. of the 19th Annual Int. ACM SIGIR Conf. 
cora	lewis1996	 Lewis, D.; Schapire, R. E.; Callan, J. P.; and Papka, R.   Training algorithms for linear text classifiers.   1996.   In Proc. of the 19th Annual Int. ACM SIGIR Conf. 
cora	lewis1996	 Lewis, D.; Schapire, R. E.; Callan, J. P.; and Papka, R.   Training algorithms for linear text classifiers.   1996.   In Proc. of the 19th Annual Int. ACM SIGIR Conf. 
cora	lewis1996	 Lewis, D.; Schapire, R.; Callan, J.; and Papka, R.   Training algorithms for linear text classifiers.   1996.   In Proceedings of ACM SIGIR Conference. 
cora	lewis1996	 Lewis, D.; Schapire, R.; Callan, J.; and Papka, R.   Training algorithms for linear text classifiers.   1996.   In Proceedings of ACM SIGIR Conference. 
cora	lewis1996	 Lewis, D.; Schapire, R.; Callan, J.; and Papka, R.   Training algorithms for linear text classifiers.   1996.   In Proceedings of ACM SIGIR Conference. 
cora	lewis1996	 Lewis, D.; Schapire, R.; Callan, J.; and Papka, R.   Training algorithms for linear text classifiers.   1996.   In Proceedings of ACM SIGIR Conference. 
cora	lewis1996	 Lewis, D.; Schapire, R.; Callan, J.; and Papka, R.   Training algorithms for linear text classifiers.   1996.   In Proceedings of ACM SIGIR Conference. 
cora	lewis1996	 Lewis, D.; Schapire, R.; Callan, J.; and Papka, R.   Training algorithms for linear text classifiers.   1996.   In Proceedings of ACM SIGIR Conference. 
cora	lewis1996	 David Lewis, Robert Schapire, James P. Callan, and Ron Papka.   Training algorithms for linear classifiers.   1996.   In Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 Lewis, D. D., Schapire, R. E., Callan, J. P., and Papka, R.   Training algorithms for linear text classifiers.    In Proceedings of ACM/SIGIR (1996). 
cora	lewis1996	 D. D. Lewis, R. E. Schapire, J. P. Callan, and R. Papka.   Training algorithms for linear text classifiers.   1996.   In Proceedings of the Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 D. D. Lewis, R. E. Schapire, J. P. Callan, and R. Papka.   Training algorithms for linear text classifiers.   1996.   In Proceedings of the Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 David D. Lewis, Robert E. Schapire, James P. Callan, and Ron Papka.   Training algorithms for linear text classifiers.   1996.   In SIGIR '96: Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 David D. Lewis, Robert E. Schapire, James P. Callan, and Ron Papka.   Training algorithms for linear text classifiers.   1996.   In SIGIR '96: Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 David D. Lewis, Robert E. Schapire, James P. Callan, and Ron Papka.   Training algorithms for linear text classifiers.   1996.   In SIGIR '96: Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 D. Lewis, R. Schapire, J. Callan, and R. Papka,   "Training Algorithms for Linear Text Classifiers,"   1996.   Proceeding of SIGIR, 
cora	lewis1996	 D. Lewis, R. Schapire, J. Callan, and R. Papka,   "Training Algorithms for Linear Text Classifiers,"   1996.   Proceeding of SIGIR, 
cora	lewis1996	 D. Lewis, R. Schapire, J. Callan, and R. Papka,   "Training Algorithms for Linear Text Classifiers,"   1996.   Proceeding of SIGIR, 
cora	lewis1996	 D. Lewis, R. Schapire, J. Callan, and R. Papka.   Training algorithms for linear text classifiers.   1996.   In Proceedings of SIGIR '96, 
cora	lewis1996	 D. Lewis, R. Schapire, J. Callan, and R. Papka.   Training algorithms for linear text classifiers.   1996.   In Proceedings of SIGIR '96, 
cora	lewis1996	 D. Lewis, R. Schapire, J. Callan, and R. Papka,   "Training Algorithms for Linear Text Classifiers,"   1996.   Proceedings of SIGIR, 
cora	lewis1996	 David Lewis, Robert Schapire, James Callan, and Ron Papka.   Training algorithm for linear text classi fiers. In Hans-Peter Frei, Donna Harman,   1996.   Proceedings of the Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 D. Lewis, R. Schapire, J. Callan, and R. Papka.   Training algorithms for linear text classifiers.   1996.   In SIGIR-96, 
cora	lewis1996	 David Lewis, Robert Schapire, James Callan, and Ron Papka.   Training algorithm for linear text classifiers.   1996.   In Proceedings of the Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 D. Lewis, R. Schapire, J. Callan, and R. Papka,   "Training Algorithms for Linear Text Classifiers",    Proceedings of SIGIR 1996, 
cora	lewis1996	 D. Lewis, R. E. Shapire, J. P. Callan, and R. Papka.   Training algorithms for linear text classifiers.   1996.   In Proceedings of the Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 David D. Lewis, Robert E. Schapire, James P. Callan, and Ron Papka.   Training algorithms for linear text classifiers.   1996.   In SIGIR '96: Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 David D. Lewis, Robert E. Schapire, James P. Callan, and Ron Papka.   Training algorithms for linear text classifiers.   1996.   In SIGIR '96: Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 David D. Lewis, Robert E. Schapire, James P. Callan, and Ron Papka.   Training algorithms for linear text classifiers.   1996.   In SIGIR '96: Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	lewis1996	 David D. Lewis, Robert E. Shapire, James P. Callan, and Ron Papka.   Training algorithms for linear text classifiers.   1996.   In Proceedings of the 19 th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 
cora	littlestone	 Littlestone, N, Schapire, and Warmuth, M.,   Hypothesis Schemas,    in progress. 
cora	rivest1987	 Rivest, R. & Schapire, R.   A new approach to unsupervised learning in deterministic environments.   (1987).   In Proceedings of the Fourth International Workshop on Machine Learning, 
cora	rivest1987	 Rivest, R. L. & Schapire, R. E.   A new approach to unsupervised learning in deterministic environments. In Langley,   (1987b).   Proceedings of the Fourth International Workshop on Machine Learning. 
cora	rivest1987	 Rivest, R. L., & Schapire, R. E.   (1987) A new approach to unsupervised learning in deterministic environments.    Proceedings of the Fourth International Workshop on Machine Learning, 
cora	rivest1987	 Rivest, R.L., & Schapire, R.E.   A new approach to unsupervised learning in deterministic environments.   (1987).   Proceedings of the Fourth International Workshop on Machine Learning, Pat Langley, 
cora	rivest1987	 R. L. Rivest and R. E. Schapire.   A new approach to unsupervised learning in deterministic environments. In Pat Langley, editor,   1987.   Proceedings of the Fourth International Workshop on Machine Learning, 
cora	rivest1987	 R. L. Rivest and R. E. Schapire.   A new approach to unsupervised learning in deterministic environments.   1987.   Proceedings of the Fourth International Workshop on Machine Learning, 
cora	rivest1987	 R. L. Rivest and R. E. Schapire.   A new approach to unsupervised learning in deterministic environments.   1987.   Proceedings of the Fourth International Workshop on Machine Learning, 
cora	rivest1987	 R. L. Rivest and R. E. Schapire.   A new approach to unsupervised learning in deterministic environments.   1987.   Proceedings of the Fourth International Workshop on Machine Learning, 
cora	rivest1987	 Rivest, R. L. and Schapire, R. E.   A new approach to unsupervised learning in deterministic environments. In Langley,   (1987).   Proceedings of the Fourth International Workshop on Machine Learning, 
cora	rivest1987d	 R. Rivest and R. Schapire.   Diversity-based inference of finite automata.   (1987).   Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, 
cora	rivest1987d	 Rivest, R. L. & Schapire, R. E.   Diversity-based inference of finite au tomata.   (1987a).   In Proceedings of the Twenty-Eighth Annual Symposium on Foundations of Computer Science, 
cora	rivest1987d	 Rivest, R. L., & Schapire, R. E.   Diversity-Based Inference of Finite Automata.   (1987).   In Proceedings of the 28th IEEE Symp. on Foundations of Computer Science, 
cora	rivest1987d	 Rivest, R. L., & Schapire, R. E.   Diversity-Based Inference of Finite Automata.   (1987).   In Proceedings of the 28th IEEE Symp. on Foundations of Computer Science, 
cora	rivest1987d	 Rivest, R.L. and Schapire, R.E.   Diversity-based inference of finite automata.   1987.   In Proceedings of 28th Foundation of Computer Science. IEEE. 
cora	rivest1987d	 Rivest, R.L. and Schapire, R.E.   Diversity-based inference of finite automata.   1987.   In Proceedings of 28th Foundation of Computer Science. IEEE. 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of Foundations of Computer Science, 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of Foundations of Computer Science, 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of Foundations of Computer Science, 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of the 29th ACM Symposium on Foundations of Computer Science, 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of the 29th ACM Symposium on Foundations of Computer Science, 
cora	rivest1987d	 R. Rivest and S. Schapire.   Diversity-based Inference of Finite Automata.   1987.   In Proc. 28th FOCS, 
cora	rivest1987d	 R. Rivest and S. Schapire.   Diversity-based Inference of Finite Automata.   1987.   In Proc. 28th FOCS, 
cora	rivest1987d	 R. L. Rivest and R. E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of FOCS-87, 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite automata.   1987.   In 28th Annual Symposium on Foundations of Computer Science, 
cora	rivest1987d	 R. L. Rivest and R. E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of Foundations of Computer Science, 
cora	rivest1987d	 R. L. Rivest and R. E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of Foundations of Computer Science, 
cora	rivest1987d	 R. L. Rivest and R. E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of Foundations of Computer Science, 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite au tomata.   1987.   In Proceeding of the Twenty-Eighth Annual Symposium on Foundations of Computer Science, 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceeding of the Twenty-Eighth Annual Symposium on Foundations of Computer Science, 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceeding of the Twenty-Eighth Annual Symposium on Foundations of Computer Science, 
cora	rivest1987d	 R. L. Rivest and R. E. Schapire.   Diversity based inference of finite automata.   1987.   In IEEE Symposium on the Foundations of Computer Science, 
cora	rivest1987d	 R. L. Rivest and R. E. Schapire.   Diversity-Based Inference of Finite Automata.   1987.   In Proc. 28th IEEE Symp. on Foundations of Computer Science, 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of the Twenty-Eighth Annual Symposium on Foundations of Computer Science, 
cora	rivest1987d	 Ronald L. Rivest and Robert E. Schapire.   Diversity-based inference of finite automata.   1987.   In Proceedings of the Twenty-Eighth Annual Symposium on Foundations of Computer Science, 
cora	rivest1989	 Rivest, R. L., & Schapire, R. E.   Inference of Finite Automata Using Homing Sequences.   (1989).   In Proceedings of the 21th ACM Symp. on Theory of Computing, 
cora	rivest1989	 Rivest, R. L., & Schapire, R. E.   Inference of Finite Automata Using Homing Sequences.   (1989).   In Proceedings of the 21th ACM Symp. on Theory of Computing, 
cora	rivest1989	 Rivest, R.L. and Schapire, R.E.   Inference of finite automata using homing sequences.   1989.   In Proceedings of 21th Annual ACM Sympposium on Theory of Computing. 
cora	rivest1989	 Rivest, R.L. and Schapire, R.E.   Inference of finite automata using homing sequences.   1989.   In Proceedings of 21th Annual ACM Sympposium on Theory of Computing. 
cora	rivest1989	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proceedings of the 21th ACM Symposium on Theory and Computing, 
cora	rivest1989	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proceedings of 21th Annual ACM Symposium on Theory of Computing, 
cora	rivest1989	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proceedings of 21th Annual ACM Symposium on Theory of Computing, 
cora	rivest1989	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theoretical Computing, 
cora	rivest1989	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theoretical Computing, 
cora	rivest1989	 R. Rivest and S. Schapire.   Inference of Finite Automata Using Homing Sequences.   1989.   In Proc. 21st STOC, 
cora	rivest1989	 R. Rivest and S. Schapire.   Inference of Finite Automata Using Homing Sequences.   1989.   In Proc. 21st STOC, 
cora	rivest1989	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	rivest1989	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences (extended abstract).   1989.   In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 
cora	rivest1989	 R. Rivest and R. Schapire.   Inference of Finite Automata using Homing Sequences.   1989.   Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 
cora	rivest1989	 R. Rivest and R. Schapire.   Inference of Finite Automata using Homing Sequences.   1989.   Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 
cora	rivest1989	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 
cora	rivest1989	 Rivest, Ronald L. and Robert E. Schapire.   "Inference of Finite Automata using Homing Sequences,"   1989,   Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, ACM, 
cora	rivest1989	 Rivest, Ronald L. and Robert E. Schapire.   "Inference of Finite Automata using Homing Sequences,"   1989,   Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, ACM, 
cora	rivest1989	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	rivest1989	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences.   1989.   In ACM Symposium on the Theory of Computing, 
cora	rivest1989	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 
cora	rivest1989	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proc. 21st Ann. ACM Symp. on Theoretical Computing, 
cora	rivest1989	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1989.   In Proc. 21st Ann. ACM Symp. on Theoretical Computing, 
cora	rivest1992	 R. Rivest,   "The MD5 message-digest algorithm," Network Working Group Request for Comments RFC 1321,   1992. </date> <note> H. Schulzrinne Expires 03/01/94 [Page 56] INTERNET-DRAFT draft-ietf-avt-issues-01.ps October 20, </note> <date> 1993   IETF, 
cora	rivest1992	 R. Rivest,   The MD5 message-digest algorithm, Request for Comments (Informational) RFC 1321,   1992.  
cora	rivest1992	 R. Rivest,   The MD5 message-digest algorithm, Request for Comments (Informational) RFC 1321,   1992.  
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   (1993).   Information and Computation, 
cora	rivest1993	 Rivest, R. & Schapire, R.   "Inference of finite automata using homing sequences",   (1993),   Information and Computation 103(2), 
cora	rivest1993	 Rivest, R. & Schapire, R.   "Inference of finite automata using homing sequences",   (1993),   Information and Computation 103(2), 
cora	rivest1993	 Rivest, R. & Schapire, R.   "Inference of finite automata using homing sequences",   (1993),   Information and Computation 103(2), 
cora	rivest1993	 Rivest, R. L. & Schapire, R. E.   Inference of finite automata using homing sequences.   (1993).   Information and Computation, 
cora	rivest1993	 Rivest, R. L., & Schapire, R. E.   Inference of finite automata using homing sequences.   (1993).   Information and Computation, 
cora	rivest1993	 Rivest, R. L., & Schapire, R. E.   Inference of finite automata using homing sequences.   (1993).   Information and Computation, 
cora	rivest1993	 Rivest, R. L., & Schapire, R. E.   Inference of finite automata using homing sequences.   (1993).   Information and Computation, 
cora	rivest1993	 Rivest, R. L., & Schapire, R. E.   Inference of finite automata using homing sequences.   (1993).   Information and Computation, 
cora	rivest1993	 Rivest, R. L., & Schapire, R. E.   Inference of finite automata using homing sequences.   (1993).   Information and Computation, 
cora	rivest1993	 Rivest, R. L., and Schapire, R. E.   Inference of finite automata using homing sequences.   1993.   Information and Computation 103(2) 
cora	rivest1993	 Rivest, R.L. and R.E. Schapire,   1993 Inference of Finite Automata Using Homing Sequences.    Information and Computation, 
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1993.  
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1993.  
cora	rivest1993	 Ronald. L. Rivest and Robert. E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R.E. Schapire R. L. Rivest.   Inference of finite automata using homing sequences. In R.L.   1993.   Machine Learning: From Theory to Applications, 
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R.L. Rivest and R.E. Schapire,   Inference of finite automata using homing sequences,    In formation and Computation 103 #2 (1993), 
cora	rivest1993	 Ronald. L. Rivest and Robert. E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R.L. Rivest and R.E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R.L. Rivest and R.E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Rivest R.L. and Schapire R.E.   Inference of finite automata using homing sequences.   1997.   Information and Computation, 
cora	rivest1993	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R.E. Schapire R. L. Rivest.   Inference of finite automata using homing sequences. In R.L.   1993.   Machine Learning: From Theory to Applications, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 R. L. Rivest and R. E. Schapire.   Inference of finite automata using homing sequences. Information and Computation,   1993.  
cora	rivest1993	 R. Rivest and R. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Compuation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Ronald L. Rivest and Robert E. Schapire.   Inference of finite automata using homing sequences.   1993.   Information and Computation, 
cora	rivest1993	 Rivest, R., and Schapire, R.   Inference of finite automata using homing sequences.   1993.   Information and Computation 103 
cora	rivest1993	 Rivest, R. L. and Schapire, R. E.   Inference of finite automata using homing sequences.   (1993).   Information and Computation, 
cora	rivest1994	 R. Rivest and R. Schapire.   Diversity-based inference of finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	rivest1994	 R. Rivest and R. Schapire.   Diversity-based inference of finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	rivest1994	 R. L. Rivest and R. E. Schapire.   Diversity-based inference of finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	rivest1994	 R. Rivest and R. Schapire.   Diversity-based inference of finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	rivest1994	 R. Rivest and R. Schapire.   Diversity-based inference of finite automata.   1994.   Journal of the Association for Computing Machinery, 
cora	rivest1994	 R. L. Rivest and R. E. Schapire.   Diversity-based inference of finite automata.   1993.   Journal of the Association for Computing Machinery, 
cora	schapire	 Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee.   Boosting the margin: A new explanation for the effectiveness of voting methods.    Annals of Statistics, 
cora	schapire	 Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee.   Boosting the margin: A new explanation for the effectiveness of voting methods.    Annals of Statistics, 
cora	schapire	 Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee.   Boosting the margin: A new explanation for the effectiveness of voting methods.    Annals of Statistics, 
cora	schapire	 Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee.   Boosting the margin: A new explanation for the effectiveness of voting methods.    Annals of Statistics, 
cora	schapire1988	 Schapire, R. E.   Diversity-based inference of finite automata.   (1988).   Master's thesis, 
cora	schapire1989	 R. Schapire.   On the strength of weak learnability.   1989,   Proceedings of the 30th I.E.E.E. Symposium on the Foundations of Computer Science, 
cora	schapire1989	 R. Schapire.   On the strength of weak learnability.   1989,   42 Proceedings of the 30th I.E.E.E. Symposium on the Foundations of Computer Science, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability. </i> <venue> Machine Learning, </venue> <volume> 5(2) </volume> <pages> 197-227, </pages> <month> June </month> <date> 1990. </date> <i> COMBINING REGRESSION ESTIMATES 29   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Schapire, R.   `The strength of weak learnability',   (1990),   Machine Learning 5(2), 
cora	schapire1990	 Schapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R.   The strength of Weak Learnability Machine Learning,   (1990.)   5, 
cora	schapire1990	 Schapire, R. E.   "The strength of weak learnability",   (1990),   Machine Learning 5(2), 
cora	schapire1990	 Schapire, R. E.   "The strength of weak learnability",   (1990),   Machine Learning 5(2), 
cora	schapire1990	 Schapire, R. E.   "The strength of weak learnability",   (1990),   Machine Learning 5(2), 
cora	schapire1990	 Schapire, R. E.   "The strength of weak learnability",   (1990),   Machine Learning 5(2), 
cora	schapire1990	 Schapire, R. E.   "The strength of weak learnability",   (1990),   Machine Learning 5(2), 
cora	schapire1990	 Schapire, R. E.   "The strength of weak learnability",   (1990),   Machine Learning 5(2), 
cora	schapire1990	 Schapire, R. E.   "The strength of weak learnability",   (1990),   Machine Learning 5(2), 
cora	schapire1990	 Schapire, R. E.   `The strength of weak learnability',   (1990),   Machine Learning 5(2), 
cora	schapire1990	 Schapire, R. E.   `The strength of weak learnability',   (1990),   Machine Learning 5(2), 
cora	schapire1990	 Schapire, R. E.   The strength of weak learn-ability.   (1990).   Mach. Learn., 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R. E.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Schapire, R.E.   The Strength of Weak Learnability,   (1990),   Machine Learning, 
cora	schapire1990	 Schapire, R.E.   The Strength of Weak Learn-ability.   1990.   Machine Learning 5 
cora	schapire1990	 Schapire, R.E.   The Strength of Weak Learn-ability.   1990.   Machine Learning 5 
cora	schapire1990	 Schapire, R.E.   The Strength of Weak Learnability.   1990.   Machine Learning 5: 
cora	schapire1990	 Schapire, R.E.   The Strength of Weak Learnability.   1990.   Machine Learning 5: 
cora	schapire1990	 Schapire, R.E.,   "The Strength of Weak Learnability",   (1990),   Machine Learning, 
cora	schapire1990	 Schapire, R.E.:   The strength of weak learnability.   
cora	schapire1990	 Schapire, R.E.:   The strength of weak learnability.   
cora	schapire1990	 Schapire, Robert E.   The strength of weak learn-ability.   1990.   Machine Learning 5(2) 
cora	schapire1990	 Shapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Shapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Shapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 Shapire, R.   The strength of weak learnability.   (1990).   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Schapire, R.   The strength of weak learnability. Machine Learning 5 197-227. This article was processed using the L A T E X macro package with LLNCS style   1990.  
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R.E. Schapire,   The strength of weak learnability,   1990.   Machine Learning 5 (2), 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire,   "The strength of weak learnability,"   1990.   Machine Learning, 
cora	schapire1990	 R. Schapire.   The strength of weak learnability.   1990,   Machine Learning, 
cora	schapire1990	 Schapire, R.,   The strength of weak learnability,   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Robert E. Schapire.   The strength of weak learnability.   1990.   Machine Learning, 
cora	schapire1990	 Schapire, R.E.   The Strength of Weak Learnability.    Machine Learning 5: 
cora	schapire1990	 Shapire, R. E.,   The Strength of Weak Learnability,   1990.   Machine Learning, 
cora	schapire1990	 R. E. Schapire.   Pattern languages are not learnable.   1990.   In Proceedings of COLT '90, 
cora	schapire1990e	 Robert E. Schapire,   "The Emerging Theory of Average Case Complexity",   1990.   Tech. Report MIT/LCS/TM-431, 
cora	schapire1990e	 Robert E. Schapire,   "The Emerging Theory of Average Case Complexity",   1990.   Tech. Report MIT/LCS/TM-431, 
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 Schapire, R.,   The Design and Analysis of Efficient Learning Algorithms.   
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   (1991).  
cora	schapire1991	 Robert E. Schapire.   The design and analysis of efficient learning algorithms.   1991.   Technical Report MIT/LCS/TR-493, 
cora	schapire1991	 Robert E. Schapire.   The design and analysis of efficient learning algorithms.   1991.   Technical Report MIT/LCS/TR-493, 
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms. ACM Distinguished Dissertation Awards Series.   1991.  
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms. ACM Distinguished Dissertation Awards Series.   1991.  
cora	schapire1991	 Robert E. Schapire.   The Design and Analysis of Ef ficient Learning Algorithms.   1992.  
cora	schapire1991	 Schapire, R.,   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 R. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 Robert E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 Robert E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 Robert E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1991.  
cora	schapire1991	 Robert E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1991.   PhD thesis, 
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 R. E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 Robert E. Schapire.   private correspondence,   1992.  
cora	schapire1991	 Robert E. Schapire.   The Design and Analysis of Efficient Learning Algorithms.   1991.   PhD thesis, 
cora	schapire1991	 Schapire, R.E.,   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991	 Schapire, R.E.,   The Design and Analysis of Efficient Learning Algorithms.   1992.  
cora	schapire1991l	 Robert E. Schapire.   Learning probabilistic read-once formulas on product distributions.   1991.   In Computation Learning Theory: Proceedings of the Fourth Annual Workshop, 
cora	schapire1991l	 Robert E. Schapire.   Learning probabilistic read-once formulas on product distributions.   1991.   In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 
cora	schapire1992	 R. E. Schapire.   The Design and Analysis of Ef ficient Learning Algorithms.   1992.  
cora	schapire1992	 Robert E. Schapire.   private correspondence,   1992.  
cora	schapire1993	 R. E. Schapire, L. M. Sellie.   Learning sparse multivariate polynomial over a field with queries and counterexamples.   1993.   In Proceedings of the Sixth Annual ACM Workshop on Computational Learning Theory. 
cora	schapire1994	 Schapire, R. E. & Warmuth, M. K.   On the worst-case analysis of temporal-difference learning algorithms.   (1994).   In Machine Learning: Proceedings of the Eleventh International Conference, 
cora	schapire1994	 Schapire, R. E., and Warmuth, M. K.   On the worst-case analysis of temporal-difference learing algorithms,   (1994),   in "Proceddings, 11th International Conference on Machine Learning," 
cora	schapire1994	 Robert E. Schapire and Manfred K. Warmuth.   On the worst-case analysis of temporal-difference learning algorithms.    In Proceedings of the Eleventh International Conference on Machine Learning, 
cora	schapire1994	 Robert E. Schapire and Manfred K. Warmuth.   On the worst-case analysis of temporal-difference learning algorithms.   1994.   In Proc. 11th International Conference on Machine Learning, 
cora	schapire1994	 R. E. Schapire and M. K. Warmuth.   On the worst-case analysis of temporal-difference learing algorithms.   1994.   In Proc. 11th International Conf. on Machine Learning, 
cora	schapire1994	 R. E. Schapire and M. K. Warmuth.   On the worst-case analysis of temporal-difference learing algorithms.   1994.   In Proc. 11th International Conference on Machine Learning, 
cora	schapire1995	 Schapire, R.E., and Y. Freund,   "A decision theoretic generalization of on-line learning and its application to boosting".   1995.   In EuroColt '95,pp. 
cora	schapire1995	 Schapire, R.E., and Y. Freund,   "A decision theoretic generalization of on-line learning and its application to boosting".   1995.   In EuroColt '95,pp. 
cora	schapire1996	 R. E. Schapire and L. M. Sellie.   Learning sparse multivariate polynomials over a field with queries and counterexamples.   1996.   J. of Computer and System Sciences, 
cora	schapire1996	 R. E. Schapire and L. M. Sellie.   Learning sparse multivariate polynomials over a field with queries and counterexamples.   1996.   J. of Computer and System Sciences, 
cora	schapire1996p	 Schapire, R.E.   private communication.   (1996),  
cora	schapire1997	 Schapire R.E., Freund Y., Bartlett P., Lee W.S.:   Boosting the Margin: A new Explanation for the Effectiveness of Voting Methods,   1997.   in Proceedings of the Fourteenth International Conference on Machine Learning, 
cora	schapire1997	 R. E. Schapire, Y. Freund, P. Bartlett, and W. S. Lee.   Boosting the margin: A new explanation for the effectiveness of voting methods.   (1997).   In Machine Learning: Proceedings of the Fourteenth International Conference. 
cora	schapire1997	 Schapire, R. E., Freund, Y., Bartlett, P. & Lee, W. S.   Boosting the margin: A new explanation for the effectiveness of voting methods,   (1997),   `Machine Learning: Proceedings of the Fourteenth International Conference', 
cora	schapire1997	 Schapire, R. E., Freund, Y., Bartlett, P. & Lee, W. S. </author> <date> (1997), </date> <i> Boosting the margin: A new explanation for the effectiveness of voting methods, </i> <editor> in D. Fisher, ed., </editor> <venue> `Machine Learning: Proceedings of the Fourteenth International Conference', </venue> <publisher> Morgan Kaufmann, </publisher> <pages> pp. </pages> <note> 322-330. </note> <author> 38 ERIC BAUER AND RON KOHAVI Wolpert, D. H.   Boosting the margin: A new explanation for the effectiveness of voting methods, </i> <editor> in D. Fisher, ed., </editor> <venue> `Machine Learning: Proceedings of the Fourteenth International Conference', </venue> <publisher> Morgan Kaufmann, </publisher> <pages> pp. </pages> <note> 322-330. </note> <author> 38 ERIC BAUER AND RON KOHAVI Wolpert, D. H. </author> <date> (1992), </date> <i> `Stacked generalization',   (1997), </date> <i> Boosting the margin: A new explanation for the effectiveness of voting methods, </i> <editor> in D. Fisher, ed., </editor> <venue> `Machine Learning: Proceedings of the Fourteenth International Conference', </venue> <publisher> Morgan Kaufmann, </publisher> <pages> pp. </pages> <note> 322-330. </note> <author> 38 ERIC BAUER AND RON KOHAVI Wolpert, D. H. </author> <date> (1992),   `Machine Learning: Proceedings of the Fourteenth International Conference', </venue> <publisher> Morgan Kaufmann, </publisher> <pages> pp. </pages> <note> 322-330. </note> <author> 38 ERIC BAUER AND RON KOHAVI Wolpert, D. H. </author> <date> (1992), </date> <i> `Stacked generalization', </i> <venue> Neural Networks 5, 
cora	schapire1997	 Schapire, R. E., Freund, Y., Bartlett, P., & Lee, W. S.   Boosting the margin: A new explanation for the effectiveness of voting methods. </i> <venue> In Proceedings of the 14th International Conference on Machine Learning. </venue> <publisher> Morgan Kaufmann. 205 Seung, </publisher> <editor> H. S., Opper, M., & Sompolinsky, H. </editor> <date> (1992). </date> <i> Query by committee.   (1997). </date> <i> Boosting the margin: A new explanation for the effectiveness of voting methods. </i> <venue> In Proceedings of the 14th International Conference on Machine Learning. </venue> <publisher> Morgan Kaufmann. 205 Seung, </publisher> <editor> H. S., Opper, M., & Sompolinsky, H. </editor> <date> (1992).   In Proceedings of the 14th International Conference on Machine Learning. 
cora	schapire1997	 Schapire, R., Freund, Y., Bartlett, P., and Lee, W.   Boosting the margin: A new explanation for the effectiveness of voting methods. In Machines That Learn - Snowbird.   (1997).  
cora	schapire1997	 Schapire, R., Y. Freund, P. Bartlett, and W.   Lee (1997). Boosting the margin : A new explanation for the effectiveness of voting methods.   
cora	schapire1997	 Schapire, R.E., Freund, Y., Bartlett, P., and Lee W.S.:   Boosting the margin: A new explanation for the effectiveness of voting methods.    Proceedings of the 11th International Conference on Machine Learning. 
cora	schapire1997	 Schapire, R.E., Freund, Y., Bartlett, P., and Lee,   W.S.: Boosting the margin: A new explanation for the effectiveness of voting methods.    Proceedings of the Fourteenth International Conference on Machine Learning. 
cora	schapire1997	 Schapire, R.E., Freund, Y., Bartlett, P., and Lee,   W.S.: Boosting the margin: A new explanation for the effectiveness of voting methods.    Proceedings of the Fourteenth International Conference on Machine Learning. 
cora	schapire1997	 Schapire, R.E., Freund, Y., Bartlett, P., and Lee, W.S.   Boosting the Margin:   1997.  
cora	schapire1997	 Schapire, R.E., Freund, Y., Bartlett, P., and Lee, W.S.   Boosting the Margin: A New Explanation for the Effectiveness of Voting Methods.   1997.   In Proceedings of the 14th International Conference on Machine Learning, 
cora	schapire1997	 Schapire, R.E., Y. Freund, P.   Bartlett & W.S. Lee (1997), Boosting the margin: A new explanation for the effectiveness of voting methods,    in Proceedings of the Fourteenth International Conference on Machine Learning, 
cora	schapire1997	 Shapire, R., Freund, Y., Bartlett, P. & Lee, W.   Boosting the margin: a new explanation for the effectiveness of voting methods,   (1997),   Snowbird 1997 conference. 
cora	schapire1997	 Shapire, R., Freund, Y., Bartlett, P. & Lee, W.   Boosting the margin: a new explanation for the effectiveness of voting methods,   (1997),   Snowbird 1997 conference. 
cora	schapire1997	 Shapire, R., Freund, Y., Bartlett, P. & Lee, W.   Boosting the margin: a new explanation for the effectiveness of voting methods,   (1997),   Snowbird 1997 conference. 
cora	schapire1997	 R. Schapire, Y. Freund, P. Bartlett, and W. S. Lee.   Boosting the margin; a new explanation for the effectiveness of voting methods.   1997.   In Proceedings of the Fourteenth International Conference on Machine Learning. 
cora	schapire1997	 R. Schapire, Y. Freund, P. Bartlett, and W. S. Lee.   Boosting the margin; a new explanation for the effectiveness of voting methods.   1997.   In Proceedings of the Fourteenth International Conference on Machine Learning. 
cora	schapire1997	 Schapire, R. E., Freund, Y., Bartlett, P., & Lee, W. S.   Boosting the Margin: A new explanation for the effectiveness of voting methods.   (1997).  
cora	schapire1997	 Schapire, R. E., Freund, Y., Bartlett, P., & Lee, W. S.   Boosting the Margin: A new explanation for the effectiveness of voting methods.   (1997).  
cora	schapire1997	 Schapire, R. E., Freund, Y., Bartlett, P., & Lee, W. S.   Boosting the Margin: A new explanation for the effectiveness of voting methods.   (1997).  
cora	schapire1997	 Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee.   Boosting the margin: A new explanation for the effectiveness of voting methods.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference, 
cora	schapire1997	 Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee.   Boosting the margin: A new explanation for the effectiveness of voting methods.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference, 
cora	schapire1997	 Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee.   Boosting the margin: A new explanation for the effectiveness of voting methods.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference, 
cora	schapire1997	 Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee.   Boosting the margin: A new explanation for the effectiveness of voting methods.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference, 
cora	schapire1997	 Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee.   Boosting the margin: A new explanation for the effectiveness of voting methods.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference, 
cora	schapire1997	 R.E. Schapire, Y. Freund, P. Bartlett,   and W.S. Leee. Boosting the margin: A new explanation for the effectiveness of voting methods. In Machines That Learn - Snowbird,    1997. 
cora	schapire1997	 R.E. Schapire, Y. Freund, P. Bartlett,   and W.S. Leee. Boosting the margin: A new explanation for the effectiveness of voting methods. In Machines That Learn - Snowbird,    1997. 
cora	schapire1997	 R.E. Schapire, Y. Freund, P. Bartlett,   and W.S. Leee. Boosting the margin: A new explanation for the effectiveness of voting methods. In Machines That Learn - Snowbird,    1997. 
cora	schapire1997	 R. Schapire, Y. Freund, P. Bartlett, and W. Lee.   Boosting the margin: a new explanation for the effectiveness of voting methods.   1997.   In ICML-97, 
cora	schapire1997	 R. Schapire, Y. Freund, P. Bartlett, and W. Lee.   Boosting the margin: a new explanation for the effectiveness of voting methods.   1997.   In ICML-97, 
cora	schapire1997	 R. Schapire, Y. Freund, P. Bartlett, and W. Lee.   Boosting the margin: a new explanation for the effectiveness of voting methods.   1997.   In ICML-97, 
cora	schapire1997	 Schapire, R.E., Freund, Y., Bartlett, P., and Lee,   W.S. Boosting the Margin: A New Explanation for the Effectiveness of Voting Methods.    In Proceedings of the 14th International Conference on Machine Learning, 
cora	schapire1997u	 Robert E. Schapire.   Using output codes to boost multiclass learning problems.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference, 
cora	schapire1997u	 Robert E. Schapire.   Using output codes to boost multiclass learning problems.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference, 
cora	schapire1997u	 Robert E. Schapire.   Using output codes to boost multiclass learning problems.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference, 
cora	schapire1997u	 Robert E. Schapire.   Using output codes to boost multiclass learning problems.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference, 
cora	schapire1997u	 R. E. Schapire.   Using output codes to boost multiclass learning problems.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference (ICML '97), 
cora	schapire1997u	 Robert E. Schapire.   Using output codes to boost multiclass learning problems.   1997.   In Machine Learning: Proceedings of the Fourteenth International Conference, 
cora	schapire1997um	 Schapire, R. E.   Using output codes to boost multiclass learning problems.   (1997).   Tech. rep., 
cora	schapire1998	 Schapire, R. & Singer, Y.   Improved boosting algorithms using confidence-rated predictions,   (1998),   in `Proceedings of the Eleventh Annual Conference on Computational Learning Theory'. 
cora	schapire1998	 Robert E. Schapire and Yoram Singer.   Improved boosting algorithms using confidence-rated predictions.   1998.   In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 
cora	schapire1998	 Robert E. Schapire and Yoram Singer.   Improved boosting algorithms using confidence-rated predictions.   1998.   In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 
cora	schapire1998	 Robert E. Schapire and Yoram Singer.   Improved boosting algorithms using confidence-rated predictions.   1998.   In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 
cora	schapire	 Schapire, R. E., Freund, Y., Bartlett, P., & Lee, W. S.   Boosting the margin: a new explanation for the effectiveness of voting methods.   (1998).  
cora	schapire1998mm	 Robert E. Schapire and Yoram Singer. BoosTexter:   A system for multiclass multi-label text categorization.   1998.   Unpublished manuscript, 
cora	schapire1998mm	 Robert E. Schapire and Yoram Singer. BoosTexter:   A system for multiclass multi-label text categorization.   1998.   Unpublished manuscript, 
cora	singer	 Robert E. Schapire Yoram Singer.   Improved boosting algorithms using confidence-rated predictions.   
cora	singer	 Robert E. Schapire Yoram Singer.   Improved boosting algorithms using confidence-rated predictions.   
cora	singer	 Robert E. Schapire Yoram Singer.   Improved boosting algorithms using confidence-rated predictions.   
