The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Lisa Hellerstein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz, David A. Patterson
    Failure Correction Techniques for Large Disk Arrays. [Citation Graph (5, 0)][DBLP]
    ASPLOS, 1989, pp:123-132 [Conf]
  2. Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz, David A. Patterson
    Coding Techniques for Handling Failures in Large Disk Arrays. [Citation Graph (3, 0)][DBLP]
    Algorithmica, 1994, v:12, n:2/3, pp:182-208 [Journal]
  3. Lisa Hellerstein, Philip N. Klein, Robert Wilber
    On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:5, pp:261-267 [Journal]
  4. Bernard Rosell, Lisa Hellerstein
    Naïve Bayes with Higher Order Attributes. [Citation Graph (0, 0)][DBLP]
    Canadian Conference on AI, 2004, pp:105-119 [Conf]
  5. Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks
    Minimizing DNF Formulas and AC0d Circuits Given a Truth Table. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:237-251 [Conf]
  6. Avrim Blum, Lisa Hellerstein, Nick Littlestone
    Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. [Citation Graph (0, 0)][DBLP]
    COLT, 1991, pp:157-166 [Conf]
  7. Nader H. Bshouty, Lisa Hellerstein
    Attribute-Efficient Learning in Query and Mistake-Bound Models. [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:235-243 [Conf]
  8. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
    Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:1-15 [Conf]
  9. Aaron Feigelson, Lisa Hellerstein
    Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results. [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:255-265 [Conf]
  10. Thomas R. Hancock, Lisa Hellerstein
    Learning Read-Once Formulas over Fields and Extended Bases. [Citation Graph (0, 0)][DBLP]
    COLT, 1991, pp:326-336 [Conf]
  11. Lisa Hellerstein, Marek Karpinski
    Learning Read-Once Formulas Using Membership Queries. [Citation Graph (0, 0)][DBLP]
    COLT, 1989, pp:146-161 [Conf]
  12. Yuval Marton, Ning Wu, Lisa Hellerstein
    On Compression-Based Text Classification. [Citation Graph (0, 0)][DBLP]
    ECIR, 2005, pp:300-314 [Conf]
  13. 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]
  14. Aditi Dhagat, Lisa Hellerstein
    PAC Learning with Irrelevant Attributes [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:64-74 [Conf]
  15. Joseph M. Hellerstein, Lisa Hellerstein, George Kollios
    On the Generation of 2-Dimensional Index Workloads. [Citation Graph (0, 19)][DBLP]
    ICDT, 1999, pp:113-130 [Conf]
  16. Bernard Rosell, Lisa Hellerstein, Soumya Ray, David Page
    Why skewing works: learning difficult Boolean functions with greedy tree learners. [Citation Graph (0, 0)][DBLP]
    ICML, 2005, pp:728-735 [Conf]
  17. Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu
    Flow algorithms for two pipelined filter ordering problems. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:193-202 [Conf]
  18. Lisa Hellerstein, Ehud Y. Shapiro
    Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. [Citation Graph (0, 0)][DBLP]
    SLP, 1984, pp:99-115 [Conf]
  19. Lisa Hellerstein, Collette R. Coullard
    Learning Binary Matroid Ports. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:328-335 [Conf]
  20. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
    Learning Arithmetic Read-Once Formulas [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:370-381 [Conf]
  21. Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson
    On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:676-685 [Conf]
  22. Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins
    How many queries are needed to learn? [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:190-199 [Conf]
  23. Lisa Hellerstein, Vijay Raghavan
    Exact learning of DNF formulas using DNF hypotheses. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:465-473 [Conf]
  24. 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]
  25. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski
    An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:37-61 [Journal]
  26. Collette R. Coullard, Lisa Hellerstein
    Independence and Port Oracles for Matroids, with an Application to Computational Learning Theory. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:2, pp:189-208 [Journal]
  27. Aaron Feigelson, Lisa Hellerstein
    The Forbidden Projections of Unate Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:3, pp:221-236 [Journal]
  28. Lisa Hellerstein
    Functions that are Read-Once on a Subset of their Inputs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:3, pp:235-251 [Journal]
  29. Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein
    Equational characterizations of Boolean function classes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:27-51 [Journal]
  30. Lisa Hellerstein
    On generalized constraints and certificates. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:211-232 [Journal]
  31. Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks
    Minimizing DNF Formulas and AC0 Circuits Given a Truth Table [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:126, pp:- [Journal]
  32. Aaron Feigelson, Lisa Hellerstein
    Conjunctions of Unate DNF Formulas: Learning and Structure. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:2, pp:203-228 [Journal]
  33. Dana Angluin, Lisa Hellerstein, Marek Karpinski
    Learning Read-Once Formulas with Queries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:1, pp:185-210 [Journal]
  34. Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins
    How Many Queries Are Needed to Learn? [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:5, pp:840-862 [Journal]
  35. Avrim Blum, Lisa Hellerstein, Nick Littlestone
    Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:1, pp:32-40 [Journal]
  36. Nader H. Bshouty, Lisa Hellerstein
    Attribute-Efficient Learning in Query and Mistake-Bound Models. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:56, n:3, pp:310-319 [Journal]
  37. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
    Learning Boolean Read-Once Formulas over Generalized Bases. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:521-542 [Journal]
  38. Lisa Hellerstein, Vijay Raghavan
    Exact learning of DNF formulas using DNF hypotheses. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:4, pp:435-470 [Journal]
  39. Lisa Hellerstein, Ehud Y. Shapiro
    Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1986, v:3, n:2, pp:157-184 [Journal]
  40. Stephen Taylor, Lisa Hellerstein, Shmuel Safra, Ehud Y. Shapiro
    Notes on the Complexity of Systolic Programs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1987, v:4, n:3, pp:250-265 [Journal]
  41. Lisa Hellerstein
    Book Review: ``Machine Learning: A Theoretical Approach''. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1993, v:13, n:, pp:145-149 [Journal]
  42. Lisa Hellerstein
    Guest Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1994, v:17, n:2-3, pp:111-114 [Journal]
  43. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
    Learning Arithmetic Read-Once Formulas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:706-735 [Journal]
  44. Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson
    On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:739-762 [Journal]
  45. Lisa Hellerstein, Rocco A. Servedio
    On PAC learning algorithms for rich Boolean function classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:1, pp:66-76 [Journal]

  46. Flow Algorithms for Parallel Query Optimization. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.306secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002