 | Pitt, Leonard (Leonard Pitt and Manfred K. Warmuth) -- The minimum consistent DFA problem cannot be approximated within any polynomial - 1993 |
| Pitt, Leonard (Leonard Pitt) -- On exploiting knowledge and concept use in learning theory - 1997 |
| Pitt, Leonard (Carlos Domingo, Nina Mishra and Leonard Pitt) -- Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries - 1999 |
| Pitt, Leonard (Leonard Pitt and Robert E. Reinke) -- Criteria for Polynomial-Time (Conceptual) Clustering - 1988 |
| Pitt, Leonard (Howard Aizenstein and Leonard Pitt) -- On The Learnability Of Disjunctive Normal Form Formulas - 1995 |
| Pitt, Leonard (Leonard Pitt) -- Introduction: Special Issue on Computational Learning Theory - 1990 |
| Pitt, Leonard (Stephen Kwek and Leonard Pitt) -- PAC Learning Intersections of Halfspaces with Membership Queries - 1998 |
| Pitt, Leonard (Leonard Pitt and Leslie G. Valiant) -- Computational limitations on learning from examples - 1988 |
| Pitt, Leonard (David Helmbold, Stephen Kwek and Leonard Pitt) -- Learning when to trust which experts - 1997 |
| Pitt, Leonard (Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt and Dan Roth) -- On Learning Read-k-Satisfy-j DNF - 1998 |
| Pitt, Leonard (Michael Frazier and Leonard Pitt) -- CLASSIC Learning - 1996 |
| Pitt, Leonard (Nina Mishra and Leonard Pitt) -- Generating all Maximal Independent Sets of Bounded-degree Hypergraphs - 1997 |
| Pitt, Leonard (Michael Frazier, Sally Goldman, Nina Mishra and Leonard Pitt) -- Learning from a consistently ignorant teacher - 1996 |
| Pitt, Leonard (Michael Frazier and Leonard Pitt) -- Learning from entailment: An application to propositional Horn sentences - June 1993 |
| Pitt, Leonard (Raymond Board and Leonard Pitt) -- On the Necessity of Occam Algorithms - 1992 |
