| Computational limitations on learning from examples L Pitt, LG Valiant Journal of the ACM (JACM) 35 (4), 965-984, 1988 | 716 | 1988 |
| On the learnability of Boolean formulae M Kearns, M Li, L Pitt, L Valiant Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987 | 415 | 1987 |
| Inductive inference, DFAs, and computational complexity L Pitt International Workshop on Analogical and Inductive Inference, 18-44, 1989 | 346 | 1989 |
| Learning conjunctions of Horn clauses D Angluin, M Frazier, L Pitt Machine Learning 9, 147-164, 1992 | 277 | 1992 |
| Prediction-preserving reducibility L Pitt, MK Warmuth Journal of Computer and System Sciences 41 (3), 430-467, 1990 | 240 | 1990 |
| The minimum consistent DFA problem cannot be approximated within any polynomial L Pitt, MK Warmuth Journal of the ACM (JACM) 40 (1), 95-142, 1993 | 228 | 1993 |
| Sublinear time approximate clustering. N Mishra, D Oblinger, L Pitt SODA 1, 439-447, 2001 | 153 | 2001 |
| Recent results on Boolean concept learning M Kearns, M Li, L Pitt, LG Valiant Proceedings of the Fourth International Workshop on Machine Learning, 337-352, 1987 | 147 | 1987 |
| On the necessity of Occam algorithms R Board, L Pitt Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing …, 1990 | 124 | 1990 |
| Probabilistic inductive inference L Pitt Journal of the ACM (JACM) 36 (2), 383-433, 1989 | 119 | 1989 |
| Probability and plurality for aggregations of learning machines L Pitt, CH Smith Information and Computation 77 (1), 77-92, 1988 | 118 | 1988 |
| The minimum consistent DFA problem cannot be approximated within and polynomial L Pitt, MK Warmuth Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 113 | 1989 |
| CLASSIC learning M Frazier, L Pitt Proceedings of the seventh annual conference on Computational learning …, 1994 | 112 | 1994 |
| A polynomial-time algorithm for learning k-variable pattern languages from examples M Kearns, L Pitt COLT 89, 57-71, 1989 | 106 | 1989 |
| Reductions among prediction problems: on the difficulty of predicting automata L Pitt, MK Warmuth [1988] Proceedings. Structure in Complexity Theory Third Annual Conference …, 1988 | 91 | 1988 |
| Learning from entailment: An application to propositional Horn sentences M Frazier, L Pitt Proceedings of the Tenth International Conference on International …, 1993 | 85 | 1993 |
| Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries C Domingo, N Mishra, L Pitt Machine learning 37, 89-110, 1999 | 84 | 1999 |
| A characterization of probabilistic inference L Pitt 25th Annual Symposium onFoundations of Computer Science, 1984., 485-494, 1984 | 76 | 1984 |
| Exact learning of read-twice DNF formulas H Aizenstein, L Pitt [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science …, 1991 | 70 | 1991 |
| Learning conjunctions of Horn clauses D Angluin, M Frazier, L Pitt Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990 | 69 | 1990 |
