| 1 | -- | 0 | Lisa Hellerstein, Hans-Ulrich Simon. Special Issue: Learning Theory 2006 |
| 2 | -- | 12 | Adam R. Klivans, Alexander A. Sherstov. Cryptographic hardness for learning intersections of halfspaces |
| 13 | -- | 26 | Vitaly Feldman. Hardness of approximate two-level logic minimization and PAC learning with membership queries |
| 27 | -- | 36 | Lance Fortnow, Adam R. Klivans. Efficient learning algorithms yield circuit lower bounds |
| 37 | -- | 59 | Benjamin I. P. Rubinstein, Peter L. Bartlett, J. Hyam Rubinstein. Shifting: One-inclusion mistake bounds and sample compression |
| 60 | -- | 77 | Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu. Learning a circuit by injecting values |
| 78 | -- | 89 | Maria-Florina Balcan, Alina Beygelzimer, John Langford. Agnostic active learning |