Leonard Pitt

According to our database, Leonard Pitt authored at least 46 papers between 1984 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Designing and Piloting a High School CS+X Topics Course.

Kathleen Isenegger, Max Fowler, Yael Gertner, Raya Hegeman-Davis, Leonard Pitt

Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

2005

Maximal boasting.

Cinda Heeren, Leonard Pitt

Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

2004

Version spaces and the consistency problem.

Haym Hirsh, Nina Mishra, Leonard Pitt

Artif. Intell., 2004

2003

Optimal indexing using near-minimal space.

Cinda Heeren, H. V. Jagadish, Leonard Pitt

Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

Optimized Disjunctive Association Rules via Sampling.

Joseph Elble, Cinda Heeren, Leonard Pitt

Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003

2001

Sublinear time approximate clustering.

Nina Mishra, Daniel Oblinger, Leonard Pitt

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

1999

Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries.

Carlos Domingo, Nina Mishra, Leonard Pitt

Mach. Learn., 1999

1998

On Learning Read-k-Satisfy-j DNF.

Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth

SIAM J. Comput., 1998

Complexity Theoretic Hardness Results for Query Learning.

Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt

Comput. Complex., 1998

PAC Learning Intersections of Halfspaces with Membership Queries.

Stephen Kwek, Leonard Pitt

Algorithmica, 1998

1997

Learning When to Trust Which Experts.

David P. Helmbold, Stephen Kwek, Leonard Pitt

Proceedings of the Computational Learning Theory, Third European Conference, 1997

Generating all Maximal Independent Sets of Bounded-Degree Hypergraphs.

Nina Mishra, Leonard Pitt

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

On Exploiting Knowledge and Concept Use in Learning Theory.

Leonard Pitt

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

Version Spaces without Boundary Sets.

Haym Hirsh, Nina Mishra, Leonard Pitt

Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996

Classic Learning.

Michael Frazier, Leonard Pitt

Mach. Learn., 1996

Learning from a Consistently Ignorant Teacher.

Michael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt

J. Comput. Syst. Sci., 1996

PAC Learning Intersections of Halfspaces with Membership Queries (Extended Abstract).

Stephen Kwek, Leonard Pitt

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

1995

On The Learnability Of Disjunctive Normal Form Formulas.

Howard Aizenstein, Leonard Pitt

Mach. Learn., 1995

1994

On Learning Read-<i>k</i>-Satisfy-<i>j</i> DNF.

Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993

The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial.

Leonard Pitt, Manfred K. Warmuth

J. ACM, 1993

Learning From Entailment: An Application to Propositional Horn Sentences.

Michael Frazier, Leonard Pitt

Proceedings of the Machine Learning, 1993

Some new directions in computational learning theory.

Michael Frazier, Leonard Pitt

Proceedings of the First European Conference on Computational Learning Theory, 1993

1992

On the Necessity of Occam Algorithms.

Raymond A. Board, Leonard Pitt

Theor. Comput. Sci., 1992

Learning Conjunctions of Horn Clauses.

Dana Angluin, Michael Frazier, Leonard Pitt

Mach. Learn., 1992

A Bounded Approximation for the Minimum Cost 2-Sat Problem.

Dan Gusfield, Leonard Pitt

Algorithmica, 1992

Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries

Howard Aizenstein, Lisa Hellerstein, Leonard Pitt

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Exact Learning of Read-<i>k</i> Disjoint DNF and Not-So-Disjoint DNF.

Howard Aizenstein, Leonard Pitt

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Exact Learning of Read-Twice DNF Formulas (Extended Abstract)

Howard Aizenstein, Leonard Pitt

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract).

Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990

Introduction: Special Issue on Computational Learning Theory.

Leonard Pitt

Mach. Learn., 1990

Prediction-Preserving Reducibility.

Leonard Pitt, Manfred K. Warmuth

J. Comput. Syst. Sci., 1990

Learning Conjunctions of Horn Clauses (Extended Abstract)

Dana Angluin, Michael Frazier, Leonard Pitt

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Learning Conjunctions of Horn Clauses (Abstract).

Dana Angluin, Michael Frazier, Leonard Pitt

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989

Semi-Supervised Learning.

Raymond A. Board, Leonard Pitt

Mach. Learn., 1989

Probabilistic inductive inference.

Leonard Pitt

J. ACM, 1989

A Polynomial-Time Algorithm for Learning <i>k-</i>Variable Pattern Languages from Examples.

Michael J. Kearns, Leonard Pitt

Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial (abstract).

Leonard Pitt, Manfred K. Warmuth

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

Inductive Inference, DFAs, and Computational Complexity.

Leonard Pitt

Proceedings of the Analogical and Inductive Inference, 1989

1988

Probability and Plurality for Aggregations of Learning Machines

Leonard Pitt, Carl H. Smith

Inf. Comput., April, 1988

Computational limitations on learning from examples.

Leonard Pitt, Leslie G. Valiant

J. ACM, 1988

Reductions among prediction problems: on the difficulty of predicting automata.

Leonard Pitt, Manfred K. Warmuth

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1987

Criteria for Polynomial-Time (Conceptual) Clustering.

Leonard Pitt, Robert E. Reinke

Mach. Learn., 1987

A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs.

Leonard Pitt

Inf. Process. Lett., 1987

On the Learnability of Boolean Formulae

Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986

Equivalent Approximation Algorithms for Node Cover.

Dan Gusfield, Leonard Pitt

Inf. Process. Lett., 1986

1984

A Characterization of Probabilistic Inference

Leonard Pitt

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984