 | Pitt, L. (M. Frazier, S. Goldman, N. Mishra and L. Pitt) -- Learning from a consistently ignorant teacher - 1994 |
| Pitt, L. (D. Angluin, M. Frazier and L. Pitt) -- Learning conjunctions of Horn clauses - 1992 |
| Pitt, L. (M. Kearns and L. Pitt) -- A polynomial-time algorithm for learning k-variable pattern languages from examples - 1989 |
| Pitt, L. (L. Pitt) -- Probabilistic Inductive Inference (Ph.D Thesis) - 1985 |
| Pitt, L. (L. Pitt and M. K. Warmuth) -- Prediction Preserving Reducibility - December 1990 |
| Pitt, L. (L. Pitt and R. Board) -- Semi-supervised learning - 1987 |
| Pitt, L. (M. Kearns, M. Li, L. Pitt and L. Valiant) -- Recent Results on Boolean Concept Learning - June 1987 |
| Pitt, L. (R. A. Board and L. Pitt) -- Semi-Supervised Learning - 1989 |
| Pitt, L. (H. Aizenstein and L. Pitt) -- Exact learning of read-twice DNF formulas - 1991 |
| Pitt, L. (R. Daley, L. Pitt, M. Velauthapillia and T. Will) -- Relations between probabilistic and team one-shot learners - 1991 |
| Pitt, L. (L. Pitt) -- Probabilistic Inductive Inference - 1989 |
| Pitt, L. (L. Pitt and R. Board) -- On the necessity of Occam algorithms - 1990 |
| Pitt, L. (A. Blum, R. Khardon, E. Kushilevitz, L. Pitt and D. Roth) -- On learning read-k-satisfy-j DNF - 1994 |
| Pitt, L. (L. Pitt and C. Smith) -- Probability and Plurality for Aggregations of Learning Machines - 1988 |
| Pitt, L. (H. Aizenstein and L. Pitt) -- Exact learning of read-k disjoint DNF and not-so-disjoint DNF - 1992 |
| Pitt, L. (H. Aizenstein, L. Hellerstein and L. Pitt) -- Read-thrice DNF is hard to learn with membership and equivalence queries - 1992 |
| Pitt, L. (M. Frazier and L. Pitt) -- Some New Directions in Computational Learning Theory - 1994 |
| Pitt, L. (L. Pitt) -- Inductive inference, DFAs, and computational complexity - 1989 |
| Pitt, L. (M. Kearns, M. Li, L. Pitt and L. Valiant) -- On the learnability of Boolean formulae - 1987 |
