Follow
Leonard Pitt
Leonard Pitt
Professor of Computer Science
Verified email at illinois.edu - Homepage
Title
Cited by
Cited by
Year
Computational limitations on learning from examples
L Pitt, LG Valiant
Journal of the ACM (JACM) 35 (4), 965-984, 1988
6841988
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
4021987
Inductive inference, DFAs, and computational complexity
L Pitt
International Workshop on Analogical and Inductive Inference, 18-44, 1989
3411989
Learning conjunctions of Horn clauses
D Angluin, M Frazier, L Pitt
Machine Learning 9, 147-164, 1992
2701992
Prediction-preserving reducibility
L Pitt, MK Warmuth
Journal of Computer and System Sciences 41 (3), 430-467, 1990
2291990
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
2201993
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
1451987
Sublinear time approximate clustering.
N Mishra, D Oblinger, L Pitt
SODA 1, 439-447, 2001
1442001
On the necessity of Occam algorithms
R Board, L Pitt
Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing …, 1990
1201990
Probability and plurality for aggregations of learning machines
L Pitt, CH Smith
Information and Computation 77 (1), 77-92, 1988
1181988
Probabilistic inductive inference
L Pitt
Journal of the ACM (JACM) 36 (2), 383-433, 1989
1171989
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
1101989
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
1101989
CLASSIC learning
M Frazier, L Pitt
Proceedings of the seventh annual conference on Computational learning …, 1994
1081994
A polynomial-time algorithm for learning k-variable pattern languages from examples
M Kearns, L Pitt
Proceedings of the Second Annual ACM Workshop on Computational Learning …, 2014
1022014
Reductions among prediction problems: on the difficulty of predicting automata
L Pitt, MK Warmuth
1988 Structure in Complexity Theory Third Annual Conference, 60, 61, 62, 63 …, 1988
891988
Learning from entailment: An application to propositional Horn sentences
M Frazier, L Pitt
Proceedings of the Tenth International Conference on International …, 1993
851993
Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
C Domingo, N Mishra, L Pitt
Machine learning 37, 89-110, 1999
791999
A characterization of probabilistic inference
L Pitt
25th Annual Symposium onFoundations of Computer Science, 1984., 485-494, 1984
751984
Exact learning of read-twice DNF formulas
H Aizenstein, L Pitt
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science …, 1991
711991
The system can't perform the operation now. Try again later.
Articles 1–20