Leonard Pitt

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