Leonard Pitt

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 1

Top Topics

Introductory Programming

Project Based Learning

Top Venues

Publications

Kathleen Isenegger, Max Fowler, Yael Gertner, Raya Hegeman-Davis, Leonard Pitt
Designing and Piloting a High School CS+X Topics Course. SIGCSE (1) (2024)
Cinda Heeren, Leonard Pitt
Maximal boasting. KDD (2005)
Haym Hirsh, Nina Mishra, Leonard Pitt
Version spaces and the consistency problem. Artif. Intell. 156 (2) (2004)
Joseph Elble, Cinda Heeren, Leonard Pitt
Optimized Disjunctive Association Rules via Sampling. ICDM (2003)
Cinda Heeren, H. V. Jagadish, Leonard Pitt
Optimal indexing using near-minimal space. PODS (2003)
Nina Mishra, Daniel Oblinger, Leonard Pitt
Sublinear time approximate clustering. SODA (2001)
Carlos Domingo, Nina Mishra, Leonard Pitt
Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries. Mach. Learn. 37 (1) (1999)
Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt
Complexity Theoretic Hardness Results for Query Learning. Comput. Complex. 7 (1) (1998)
Stephen Kwek, Leonard Pitt
PAC Learning Intersections of Halfspaces with Membership Queries. Algorithmica 22 (1/2) (1998)
Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth
On Learning Read-k-Satisfy-j DNF. SIAM J. Comput. 27 (6) (1998)
David P. Helmbold, Stephen Kwek, Leonard Pitt
Learning When to Trust Which Experts. EuroCOLT (1997)
Leonard Pitt
On Exploiting Knowledge and Concept Use in Learning Theory. ALT (1997)
Haym Hirsh, Nina Mishra, Leonard Pitt
Version Spaces without Boundary Sets. AAAI/IAAI (1997)
Nina Mishra, Leonard Pitt
Generating all Maximal Independent Sets of Bounded-Degree Hypergraphs. COLT (1997)
Stephen Kwek, Leonard Pitt
PAC Learning Intersections of Halfspaces with Membership Queries (Extended Abstract). COLT (1996)
Michael Frazier, Leonard Pitt
Classic Learning. Mach. Learn. 25 (2-3) (1996)
Michael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt
Learning from a Consistently Ignorant Teacher. J. Comput. Syst. Sci. 52 (3) (1996)
Howard Aizenstein, Leonard Pitt
On The Learnability Of Disjunctive Normal Form Formulas. Mach. Learn. 19 (3) (1995)
Michael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt
Learning from a Consistently Ignorant Teacher. COLT (1994)
Michael Frazier, Leonard Pitt
CLASSIC Learning. COLT (1994)
Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth
DNF. COLT (1994)
Michael Frazier, Leonard Pitt
Learning From Entailment: An Application to Propositional Horn Sentences. ICML (1993)
Michael Frazier, Leonard Pitt
Some new directions in computational learning theory. EuroCOLT (1993)
Leonard Pitt, Manfred K. Warmuth
The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial. J. ACM 40 (1) (1993)
Dan Gusfield, Leonard Pitt
A Bounded Approximation for the Minimum Cost 2-Sat Problem. Algorithmica 8 (2) (1992)
Raymond A. Board, Leonard Pitt
On the Necessity of Occam Algorithms. Theor. Comput. Sci. 100 (1) (1992)
Howard Aizenstein, Lisa Hellerstein, Leonard Pitt
Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries FOCS (1992)
Howard Aizenstein, Leonard Pitt
Disjoint DNF and Not-So-Disjoint DNF. COLT (1992)
Dana Angluin, Michael Frazier, Leonard Pitt
Learning Conjunctions of Horn Clauses. Mach. Learn. 9 (1992)
Howard Aizenstein, Leonard Pitt
Exact Learning of Read-Twice DNF Formulas (Extended Abstract) FOCS (1991)
Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will
Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). COLT (1991)
Leonard Pitt, Manfred K. Warmuth
Prediction-Preserving Reducibility. J. Comput. Syst. Sci. 41 (3) (1990)
Dana Angluin, Michael Frazier, Leonard Pitt
Learning Conjunctions of Horn Clauses (Abstract). COLT (1990)
Raymond A. Board, Leonard Pitt
On the Necessity of Occam Algorithms STOC (1990)
Dana Angluin, Michael Frazier, Leonard Pitt
Learning Conjunctions of Horn Clauses (Extended Abstract) FOCS (1990)
Leonard Pitt
Introduction: Special Issue on Computational Learning Theory. Mach. Learn. 5 (1990)
Leonard Pitt
Inductive Inference, DFAs, and Computational Complexity. AII (1989)
Leonard Pitt, Manfred K. Warmuth
The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial (abstract). Computational Complexity Conference (1989)
Raymond A. Board, Leonard Pitt
Semi-Supervised Learning. Mach. Learn. 4 (1989)
Leonard Pitt
Probabilistic inductive inference. J. ACM 36 (2) (1989)
Michael J. Kearns, Leonard Pitt
Variable Pattern Languages from Examples. COLT (1989)
Leonard Pitt, Manfred K. Warmuth
The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial STOC (1989)
Leonard Pitt, Leslie G. Valiant
Computational limitations on learning from examples. J. ACM 35 (4) (1988)
Leonard Pitt, Manfred K. Warmuth
Reductions among prediction problems: on the difficulty of predicting automata. Computational Complexity Conference (1988)
Leonard Pitt, Carl H. Smith
Probability and Plurality for Aggregations of Learning Machines Inf. Comput. 77 (1) (1988)
Leonard Pitt
A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs. Inf. Process. Lett. 24 (3) (1987)
Leonard Pitt, Carl H. Smith
Probability and Plurality for Aggregations of Learning Machines. ICALP (1987)
Leonard Pitt, Robert E. Reinke
Criteria for Polynomial-Time (Conceptual) Clustering. Mach. Learn. 2 (4) (1987)
Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant
On the Learnability of Boolean Formulae STOC (1987)
Dan Gusfield, Leonard Pitt
Equivalent Approximation Algorithms for Node Cover. Inf. Process. Lett. 22 (6) (1986)
Leonard Pitt
A Characterization of Probabilistic Inference FOCS (1984)