 | Pitt, L. -- A characterization of probabilistic inference Ph.D Thesis - 1984 |
| Pitt, L. -- A characterization of probabilistic inference - 1984 |
| Pitt, L. -- Probabilistic Inductive Inference Ph.D Thesis - 1985 |
| Pitt, L. -- Semi-supervised learning - 1987 |
| Kearns, M. -- On the learnability of Boolean formulae - 1987 |
| Kearns, M. -- Recent Results on Boolean Concept Learning - June 1987 |
| Pitt, L. -- Criteria for Polynomial Time Conceptual Clustering - 1988 |
| Pitt, L. -- Computational limitations on learning from examples - 1988 |
| Pitt, L. -- Probability and Plurality for Aggregations of Learning Machines - 1988 |
| Pitt, L. -- Probabilistic Inductive Inference - 1989 |
| Board, R. A. -- Semi-Supervised Learning - 1989 |
| Kearns, M. -- A polynomial-time algorithm for learning k-variable pattern languages from examples - 1989 |
| Pitt, L. -- Inductive Inference, DFAs, and Computational Complexity - October 1989 |
| Pitt, L. -- On the necessity of Occam algorithms - 1990 |
| Pitt, L. -- Prediction Preserving Reducibility - December 1990 |
| Daley, R. -- Relations between probabilistic and team one-shot learners - 1991 |
| Aizenstein, H. -- Exact learning of read-twice DNF formulas - 1991 |
| Angluin, D. -- Learning conjunctions of Horn clauses - 1992 |
| Aizenstein, H. -- Exact learning of read-k disjoint DNF and not-so-disjoint DNF - 1992 |
| Aizenstein, H. -- Read-thrice DNF is hard to learn with membership and equivalence queries - 1992 |
| Board, R. -- On the Necessity of Occam Algorithms - 1992 |
| Pitt, L. -- The minimum consistent DFA problem cannot be approximated within any polynomial - 1993 |
| Frazier, M. -- Some New Directions in Computational Learning Theory - 1994 |
| Blum, A. -- On learning read-k-satisfy-j DNF - 1994 |
| Frazier, M. -- Learning from a consistently ignorant teacher - 1994 |
