default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonard Pitt
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c31]Kathleen Isenegger
, Max Fowler, Daphane Hammer, Benjamin Leff, Yael Gertner, Raya Hegeman-Davis, Leonard Pitt:
Integrating a CS+Social Science Project into STEM and non-STEM High School Courses. SIGCSE (1) 2025: 540-546- 2024
- [c30]Kathleen Isenegger, Max Fowler, Yael Gertner, Raya Hegeman-Davis, Leonard Pitt:
Designing and Piloting a High School CS+X Topics Course. SIGCSE (1) 2024: 562-568
2000 – 2009
- 2005
- [c29]Cinda Heeren, Leonard Pitt:
Maximal boasting. KDD 2005: 580-585 - 2004
- [j21]Haym Hirsh, Nina Mishra, Leonard Pitt:
Version spaces and the consistency problem. Artif. Intell. 156(2): 115-138 (2004) - 2003
- [c28]Joseph Elble, Cinda Heeren, Leonard Pitt:
Optimized Disjunctive Association Rules via Sampling. ICDM 2003: 43-50 - [c27]Cinda Heeren, H. V. Jagadish, Leonard Pitt:
Optimal indexing using near-minimal space. PODS 2003: 244-251 - 2001
- [c26]Nina Mishra, Daniel Oblinger, Leonard Pitt:
Sublinear time approximate clustering. SODA 2001: 439-447
1990 – 1999
- 1999
- [j20]Carlos Domingo, Nina Mishra, Leonard Pitt:
Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries. Mach. Learn. 37(1): 89-110 (1999) - 1998
- [j19]Stephen Kwek, Leonard Pitt:
PAC Learning Intersections of Halfspaces with Membership Queries. Algorithmica 22(1/2): 53-75 (1998) - [j18]Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt:
Complexity Theoretic Hardness Results for Query Learning. Comput. Complex. 7(1): 19-53 (1998) - [j17]Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth:
On Learning Read-k-Satisfy-j DNF. SIAM J. Comput. 27(6): 1515-1530 (1998) - 1997
- [c25]Haym Hirsh, Nina Mishra, Leonard Pitt:
Version Spaces without Boundary Sets. AAAI/IAAI 1997: 491-496 - [c24]Leonard Pitt:
On Exploiting Knowledge and Concept Use in Learning Theory. ALT 1997: 62-84 - [c23]Nina Mishra, Leonard Pitt:
Generating all Maximal Independent Sets of Bounded-Degree Hypergraphs. COLT 1997: 211-217 - [c22]David P. Helmbold, Stephen Kwek, Leonard Pitt:
Learning When to Trust Which Experts. EuroCOLT 1997: 134-149 - 1996
- [j16]Michael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt:
Learning from a Consistently Ignorant Teacher. J. Comput. Syst. Sci. 52(3): 471-492 (1996) - [j15]Michael Frazier, Leonard Pitt:
Classic Learning. Mach. Learn. 25(2-3): 151-193 (1996) - [c21]Stephen Kwek, Leonard Pitt:
PAC Learning Intersections of Halfspaces with Membership Queries (Extended Abstract). COLT 1996: 244-254 - 1995
- [j14]Howard Aizenstein, Leonard Pitt:
On The Learnability Of Disjunctive Normal Form Formulas. Mach. Learn. 19(3): 183-208 (1995) - 1994
- [c20]Michael Frazier, Leonard Pitt:
CLASSIC Learning. COLT 1994: 23-34 - [c19]Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth:
On Learning Read-k-Satisfy-j DNF. COLT 1994: 110-117 - [c18]Michael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt:
Learning from a Consistently Ignorant Teacher. COLT 1994: 328-339 - 1993
- [j13]Leonard Pitt, Manfred K. Warmuth:
The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial. J. ACM 40(1): 95-142 (1993) - [c17]Michael Frazier, Leonard Pitt:
Some new directions in computational learning theory. EuroCOLT 1993: 19-32 - [c16]Michael Frazier, Leonard Pitt:
Learning From Entailment: An Application to Propositional Horn Sentences. ICML 1993: 120-127 - 1992
- [j12]Dan Gusfield, Leonard Pitt:
A Bounded Approximation for the Minimum Cost 2-Sat Problem. Algorithmica 8(2): 103-117 (1992) - [j11]Dana Angluin, Michael Frazier, Leonard Pitt:
Learning Conjunctions of Horn Clauses. Mach. Learn. 9: 147-164 (1992) - [j10]Raymond A. Board, Leonard Pitt:
On the Necessity of Occam Algorithms. Theor. Comput. Sci. 100(1): 157-184 (1992) - [c15]Howard Aizenstein, Leonard Pitt:
Exact Learning of Read-k Disjoint DNF and Not-So-Disjoint DNF. COLT 1992: 71-76 - [c14]Howard Aizenstein, Lisa Hellerstein, Leonard Pitt:
Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries. FOCS 1992: 523-532 - 1991
- [c13]Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will:
Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). COLT 1991: 228-239 - [c12]Howard Aizenstein, Leonard Pitt:
Exact Learning of Read-Twice DNF Formulas (Extended Abstract). FOCS 1991: 170-179 - 1990
- [j9]Leonard Pitt, Manfred K. Warmuth:
Prediction-Preserving Reducibility. J. Comput. Syst. Sci. 41(3): 430-467 (1990) - [j8]Leonard Pitt:
Introduction: Special Issue on Computational Learning Theory. Mach. Learn. 5: 117-120 (1990) - [c11]Dana Angluin, Michael Frazier, Leonard Pitt:
Learning Conjunctions of Horn Clauses (Abstract). COLT 1990: 387 - [c10]Dana Angluin, Michael Frazier, Leonard Pitt:
Learning Conjunctions of Horn Clauses (Extended Abstract). FOCS 1990: 186-192 - [c9]Raymond A. Board, Leonard Pitt:
On the Necessity of Occam Algorithms. STOC 1990: 54-63
1980 – 1989
- 1989
- [j7]Leonard Pitt:
Probabilistic inductive inference. J. ACM 36(2): 383-433 (1989) - [j6]Raymond A. Board, Leonard Pitt:
Semi-Supervised Learning. Mach. Learn. 4: 41-65 (1989) - [c8]Leonard Pitt:
Inductive Inference, DFAs, and Computational Complexity. AII 1989: 18-44 - [c7]Leonard Pitt, Manfred K. Warmuth:
The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial (abstract). SCT 1989: 230 - [c6]Michael J. Kearns, Leonard Pitt:
A Polynomial-Time Algorithm for Learning k-Variable Pattern Languages from Examples. COLT 1989: 57-71 - [c5]Leonard Pitt, Manfred K. Warmuth:
The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial. STOC 1989: 421-432 - 1988
- [j5]Leonard Pitt, Carl H. Smith:
Probability and Plurality for Aggregations of Learning Machines. Inf. Comput. 77(1): 77-92 (1988) - [j4]Leonard Pitt, Leslie G. Valiant:
Computational limitations on learning from examples. J. ACM 35(4): 965-984 (1988) - [c4]Leonard Pitt, Manfred K. Warmuth:
Reductions among prediction problems: on the difficulty of predicting automata. SCT 1988: 60-69 - [e1]David Haussler, Leonard Pitt:
Proceedings of the First Annual Workshop on Computational Learning Theory, COLT '88, Cambridge, MA, USA, August 3-5, 1988. ACM/MIT 1988 [contents] - 1987
- [j3]Leonard Pitt:
A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs. Inf. Process. Lett. 24(3): 203-206 (1987) - [j2]Leonard Pitt, Robert E. Reinke:
Criteria for Polynomial-Time (Conceptual) Clustering. Mach. Learn. 2(4): 371-396 (1987) - [c3]Leonard Pitt, Carl H. Smith:
Probability and Plurality for Aggregations of Learning Machines. ICALP 1987: 1-10 - [c2]Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant:
On the Learnability of Boolean Formulae. STOC 1987: 285-295 - 1986
- [j1]Dan Gusfield, Leonard Pitt:
Equivalent Approximation Algorithms for Node Cover. Inf. Process. Lett. 22(6): 291-294 (1986) - 1984
- [c1]Leonard Pitt:
A Characterization of Probabilistic Inference. FOCS 1984: 485-494
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-10 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
