The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leonard Pitt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Leonard Pitt
    Inductive Inference, DFAs, and Computational Complexity. [Citation Graph (1, 0)][DBLP]
    AII, 1989, pp:18-44 [Conf]
  2. Dana Angluin, Michael Frazier, Leonard Pitt
    Learning Conjunctions of Horn Clauses (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1990, pp:186-192 [Conf]
  3. Dana Angluin, Michael Frazier, Leonard Pitt
    Learning Conjunctions of Horn Clauses. [Citation Graph (1, 0)][DBLP]
    Machine Learning, 1992, v:9, n:, pp:147-164 [Journal]
  4. Haym Hirsh, Nina Mishra, Leonard Pitt
    Version Spaces without Boundary Sets. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1997, pp:491-496 [Conf]
  5. Leonard Pitt
    On Exploiting Knowledge and Concept Use in Learning Theory. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:62-84 [Conf]
  6. Leonard Pitt, Manfred K. Warmuth
    The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial (abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:230- [Conf]
  7. Howard Aizenstein, Leonard Pitt
    Exact Learning of Read-k Disjoint DNF and Not-So-Disjoint DNF. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:71-76 [Conf]
  8. Dana Angluin, Michael Frazier, Leonard Pitt
    Learning Conjunctions of Horn Clauses (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:387- [Conf]
  9. Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth
    On Learning Read-k-Satisfy-j DNF. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:110-117 [Conf]
  10. Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will
    Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1991, pp:228-239 [Conf]
  11. Michael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt
    Learning from a Consistently Ignorant Teacher. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:328-339 [Conf]
  12. Michael Frazier, Leonard Pitt
    CLASSIC Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:23-34 [Conf]
  13. Michael J. Kearns, Leonard Pitt
    A Polynomial-Time Algorithm for Learning k-Variable Pattern Languages from Examples. [Citation Graph (0, 0)][DBLP]
    COLT, 1989, pp:57-71 [Conf]
  14. Stephen Kwek, Leonard Pitt
    PAC Learning Intersections of Halfspaces with Membership Queries (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:244-254 [Conf]
  15. Nina Mishra, Leonard Pitt
    Generating all Maximal Independent Sets of Bounded-Degree Hypergraphs. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:211-217 [Conf]
  16. David P. Helmbold, Stephen Kwek, Leonard Pitt
    Learning When to Trust Which Experts. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:134-149 [Conf]
  17. Howard Aizenstein, Lisa Hellerstein, Leonard Pitt
    Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:523-532 [Conf]
  18. Howard Aizenstein, Leonard Pitt
    Exact Learning of Read-Twice DNF Formulas (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:170-179 [Conf]
  19. Leonard Pitt
    A Characterization of Probabilistic Inference [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:485-494 [Conf]
  20. Leonard Pitt, Carl H. Smith
    Probability and Plurality for Aggregations of Learning Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:1-10 [Conf]
  21. Joseph Elble, Cinda Heeren, Leonard Pitt
    Optimized Disjunctive Association Rules via Sampling. [Citation Graph (0, 0)][DBLP]
    ICDM, 2003, pp:43-50 [Conf]
  22. Michael Frazier, Leonard Pitt
    Learning From Entailment: An Application to Propositional Horn Sentences. [Citation Graph (0, 0)][DBLP]
    ICML, 1993, pp:120-127 [Conf]
  23. Cinda Heeren, Leonard Pitt
    Maximal boasting. [Citation Graph (0, 0)][DBLP]
    KDD, 2005, pp:580-585 [Conf]
  24. Cinda Heeren, H. V. Jagadish, Leonard Pitt
    Optimal indexing using near-minimal space. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:244-251 [Conf]
  25. Nina Mishra, Daniel Oblinger, Leonard Pitt
    Sublinear time approximate clustering. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:439-447 [Conf]
  26. Raymond A. Board, Leonard Pitt
    On the Necessity of Occam Algorithms [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:54-63 [Conf]
  27. Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant
    On the Learnability of Boolean Formulae [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:285-295 [Conf]
  28. Leonard Pitt, Manfred K. Warmuth
    The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:421-432 [Conf]
  29. Haym Hirsh, Nina Mishra, Leonard Pitt
    Version spaces and the consistency problem. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:156, n:2, pp:115-138 [Journal]
  30. Dan Gusfield, Leonard Pitt
    A Bounded Approximation for the Minimum Cost 2-Sat Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:2, pp:103-117 [Journal]
  31. Stephen Kwek, Leonard Pitt
    PAC Learning Intersections of Halfspaces with Membership Queries. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:1/2, pp:53-75 [Journal]
  32. Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt
    Complexity Theoretic Hardness Results for Query Learning. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:1, pp:19-53 [Journal]
  33. Leonard Pitt, Carl H. Smith
    Probability and Plurality for Aggregations of Learning Machines [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:77, n:1, pp:77-92 [Journal]
  34. Dan Gusfield, Leonard Pitt
    Equivalent Approximation Algorithms for Node Cover. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:6, pp:291-294 [Journal]
  35. Leonard Pitt
    A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:3, pp:203-206 [Journal]
  36. Leonard Pitt
    Probabilistic inductive inference. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:2, pp:383-433 [Journal]
  37. Leonard Pitt, Leslie G. Valiant
    Computational limitations on learning from examples. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:965-984 [Journal]
  38. Leonard Pitt, Manfred K. Warmuth
    The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:1, pp:95-142 [Journal]
  39. Michael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt
    Learning from a Consistently Ignorant Teacher. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:3, pp:471-492 [Journal]
  40. Leonard Pitt, Manfred K. Warmuth
    Prediction-Preserving Reducibility. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:41, n:3, pp:430-467 [Journal]
  41. Howard Aizenstein, Leonard Pitt
    On The Learnability Of Disjunctive Normal Form Formulas. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1995, v:19, n:3, pp:183-208 [Journal]
  42. Raymond A. Board, Leonard Pitt
    Semi-Supervised Learning. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1989, v:4, n:, pp:41-65 [Journal]
  43. Michael Frazier, Leonard Pitt
    Classic Learning. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1996, v:25, n:2-3, pp:151-193 [Journal]
  44. Carlos Domingo, Nina Mishra, Leonard Pitt
    Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1999, v:37, n:1, pp:89-110 [Journal]
  45. Leonard Pitt
    Introduction: Special Issue on Computational Learning Theory. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1990, v:5, n:, pp:117-120 [Journal]
  46. Leonard Pitt, Robert E. Reinke
    Criteria for Polynomial-Time (Conceptual) Clustering. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1987, v:2, n:4, pp:371-396 [Journal]
  47. Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth
    On Learning Read-k-Satisfy-j DNF. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1515-1530 [Journal]
  48. Raymond A. Board, Leonard Pitt
    On the Necessity of Occam Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:100, n:1, pp:157-184 [Journal]

Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002