A Characterization of Probabilistic Inference - Leonard Pitt (FOCS, 1984)

Equivalent Approximation Algorithms for Node Cover. - Dan Gusfield; Leonard Pitt (Inf. Process. Lett., 1986)

On the Learnability of Boolean Formulae - Michael J. Kearns; Ming Li 001; Leonard Pitt; Leslie G. Valiant (STOC, 1987)

A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs. - Leonard Pitt (Inf. Process. Lett., 1987)

Criteria for Polynomial-Time (Conceptual) Clustering. - Leonard Pitt; Robert E. Reinke (Mach. Learn., 1987)

Reductions among prediction problems: on the difficulty of predicting automata. - Leonard Pitt; Manfred K. Warmuth (SCT, 1988)

Computational limitations on learning from examples. - Leonard Pitt; Leslie G. Valiant (J. ACM, 1988)

Probability and Plurality for Aggregations of Learning Machines - Leonard Pitt; Carl H. Smith (Inf. Comput., 1988)

Inductive Inference, DFAs, and Computational Complexity. - Leonard Pitt (AII, 1989)

The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial (abstract). - Leonard Pitt; Manfred K. Warmuth (SCT, 1989)

A Polynomial-Time Algorithm for Learning k-Variable Pattern Languages from Examples. - Michael J. Kearns; Leonard Pitt (COLT, 1989)

Probabilistic inductive inference. - Leonard Pitt (J. ACM, 1989)

Semi-Supervised Learning. - Raymond A. Board; Leonard Pitt (Mach. Learn., 1989)

Learning Conjunctions of Horn Clauses (Abstract). - Dana Angluin; Michael Frazier; Leonard Pitt (COLT, 1990)

Learning Conjunctions of Horn Clauses (Extended Abstract) - Dana Angluin; Michael Frazier; Leonard Pitt (FOCS, 1990)

Prediction-Preserving Reducibility. - Leonard Pitt; Manfred K. Warmuth (J. Comput. Syst. Sci., 1990)

Introduction: Special Issue on Computational Learning Theory. - Leonard Pitt (Mach. Learn., 1990)

Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). - Robert P. Daley; Leonard Pitt; Mahendran Velauthapillai; Todd Will (COLT, 1991)

Exact Learning of Read-Twice DNF Formulas (Extended Abstract) - Howard Aizenstein; Leonard Pitt (FOCS, 1991)

Exact Learning of Read-k Disjoint DNF and Not-So-Disjoint DNF. - Howard Aizenstein; Leonard Pitt (COLT, 1992)

Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries - Howard Aizenstein; Lisa Hellerstein; Leonard Pitt (FOCS, 1992)

A Bounded Approximation for the Minimum Cost 2-Sat Problem. - Dan Gusfield; Leonard Pitt (Algorithmica, 1992)

Learning Conjunctions of Horn Clauses. - Dana Angluin; Michael Frazier; Leonard Pitt (Mach. Learn., 1992)

On the Necessity of Occam Algorithms. - Raymond A. Board; Leonard Pitt (Theor. Comput. Sci., 1992)

Some new directions in computational learning theory. - Michael Frazier; Leonard Pitt (EuroCOLT, 1993)

Learning From Entailment: An Application to Propositional Horn Sentences. - Michael Frazier; Leonard Pitt (ICML, 1993)

The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial. - Leonard Pitt; Manfred K. Warmuth (J. ACM, 1993)

On Learning Read-k-Satisfy-j DNF. - Avrim Blum; Roni Khardon; Eyal Kushilevitz; Leonard Pitt; Dan Roth 001 (COLT, 1994)

On The Learnability Of Disjunctive Normal Form Formulas. - Howard Aizenstein; Leonard Pitt (Mach. Learn., 1995)

PAC Learning Intersections of Halfspaces with Membership Queries (Extended Abstract). - Stephen Kwek; Leonard Pitt (COLT, 1996)

Learning from a Consistently Ignorant Teacher. - Michael Frazier; Sally A. Goldman; Nina Mishra; Leonard Pitt (J. Comput. Syst. Sci., 1996)

Classic Learning. - Michael Frazier; Leonard Pitt (Mach. Learn., 1996)

Version Spaces without Boundary Sets. - Haym Hirsh; Nina Mishra; Leonard Pitt (AAAI/IAAI, 1997)

On Exploiting Knowledge and Concept Use in Learning Theory. - Leonard Pitt (ALT, 1997)

Generating all Maximal Independent Sets of Bounded-Degree Hypergraphs. - Nina Mishra; Leonard Pitt (COLT, 1997)

Learning When to Trust Which Experts. - David P. Helmbold; Stephen Kwek; Leonard Pitt (EuroCOLT, 1997)

PAC Learning Intersections of Halfspaces with Membership Queries. - Stephen Kwek; Leonard Pitt (Algorithmica, 1998)

Complexity Theoretic Hardness Results for Query Learning. - Howard Aizenstein; Tibor Hegedüs; Lisa Hellerstein; Leonard Pitt (Comput. Complex., 1998)

On Learning Read-k-Satisfy-j DNF. - Howard Aizenstein; Avrim Blum; Roni Khardon; Eyal Kushilevitz; Leonard Pitt; Dan Roth 001 (SIAM J. Comput., 1998)

Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries. - Carlos Domingo; Nina Mishra; Leonard Pitt (Mach. Learn., 1999)

Sublinear time approximate clustering. - Nina Mishra; Daniel Oblinger; Leonard Pitt (SODA, 2001)

Optimized Disjunctive Association Rules via Sampling. - Joseph Elble; Cinda Heeren; Leonard Pitt (ICDM, 2003)

Optimal indexing using near-minimal space. - Cinda Heeren; H. V. Jagadish; Leonard Pitt (PODS, 2003)

Version spaces and the consistency problem. - Haym Hirsh; Nina Mishra; Leonard Pitt (Artif. Intell., 2004)

Maximal boasting. - Cinda Heeren; Leonard Pitt (KDD, 2005)

Designing and Piloting a High School CS+X Topics Course. - Kathleen Isenegger; Max Fowler; Yael Gertner; Raya Hegeman-Davis; Leonard Pitt (SIGCSE (1), 2024)

Integrating a CS+Social Science Project into STEM and non-STEM High School Courses. - Kathleen Isenegger; Max Fowler; Daphane Hammer; Benjamin Leff; Yael Gertner; Raya Hegeman-Davis; Leonard Pitt (SIGCSE (1), 2025)