The probability that this list is complete is < 1.
The probability that this list has errors is > 0.
1988 3 IEEECCC Pitt & Warmuth, Reductions among Prediction Problems: On the Difficulty of Predicting Automata
1994 9 IEEECCC Gavalda, The Complexity of Learning with Queries
1998 13 IEEECCC Schuler & Watanabe, Resource Bounded Measure and Learnability
1999 14 IEEECCC Tarui & Tsukiji, Learning DNF by Approximating Inclusion-Exclusion Formulae
2001 16 IEEECCC Servedio & Gortler, Quantum versus Classical Learnability
2002 17 IEEECCC/STOC Learnability beyond AC^0, Jackson, Klivans, and Servedio
2005 20 IEEECCC Lipton & Markakis & Mehta & Vishnoi, On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas
2006 21 IEEECCC O'Donnell & Servedio, Learning Monotone Decision Trees in Polynomial Time
2008 23 IEEECCC Linial & Shraiban, Learning complexity vs communication complexity
2009 24 IEEECCC Xiao, On basing ZK \ne BPP on the hardness of PAC learning
2010 25 IEEECCC Regev, The learning with errors problem