Lisa Hellerstein

Lisa Hellerstein, Devorah Kletenik: On the gap between ess(f) and cnf_size(f). Discrete Applied Mathematics 161(1-2): 19-27 (2013)

Amol Deshpande, Lisa Hellerstein, Devorah Kletenik: Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover. CoRR abs/1303.0726 (2013)

Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio: Tight Bounds on Proper Equivalence Query Learning of DNF. Journal of Machine Learning Research - Proceedings Track 23: 31.1-31.18 (2012)

Amol Deshpande, Lisa Hellerstein: Parallel pipelined filter ordering with precedence constraints. ACM Transactions on Algorithms 8(4): 41 (2012)

Lisa Hellerstein, Devorah Kletenik: On the gap between ess(f) and cnf_size(f). ISAIM 2012

Lisa Hellerstein, Özgür Özkan, Linda Sellie: Max-Throughput for (Conservative) k-of-n Testing. ISAAC 2011: 703-713

Lisa Hellerstein, Devorah Kletenik: On the gap between ess(f) and cnf_size(f). CoRR abs/1106.4247 (2011)

Lisa Hellerstein, Özgür Özkan, Linda Sellie: Max-Throughput for (Conservative) k-of-n Testing. CoRR abs/1109.3401 (2011)

Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio: Tight Bounds on Proper Equivalence Query Learning of DNF. CoRR abs/1111.1124 (2011)

Lisa Hellerstein, Hans-Ulrich Simon: Special Issue: Learning Theory 2006. J. Comput. Syst. Sci. 75(1): 1 (2009)

Lisa Hellerstein, Bernard Rosell, Eric Bach, Soumya Ray, David Page: Exploiting Product Distributions to Identify Relevant Variables of Correlation Immune Functions. Journal of Machine Learning Research 10: 2374-2411 (2009)

Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu: Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Transactions on Algorithms 5(2) (2009)

Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks: Minimizing Disjunctive Normal Form Formulas and AC⁰ Circuits Given a Truth Table. SIAM J. Comput. 38(1): 63-84 (2008)

Amol Deshpande, Lisa Hellerstein: Flow Algorithms for Parallel Query Optimization. ICDE 2008: 754-763

Lisa Hellerstein: Certificate Complexity and Exact Learning. Encyclopedia of Algorithms 2008

Lisa Hellerstein, Rocco A. Servedio: On PAC learning algorithms for rich Boolean function classes. Theor. Comput. Sci. 384(1): 66-76 (2007)

Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks: Minimizing DNF Formulas and AC⁰_d Circuits Given a Truth Table. IEEE Conference on Computational Complexity 2006: 237-251

Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu: Flow algorithms for two pipelined filter ordering problems. PODS 2006: 193-202

Lisa Hellerstein, Vijay Raghavan: Exact learning of DNF formulas using DNF hypotheses. J. Comput. Syst. Sci. 70(4): 435-470 (2005)

Yuval Marton, Ning Wu, Lisa Hellerstein: On Compression-Based Text Classification. ECIR 2005: 300-314

Bernard Rosell, Lisa Hellerstein, Soumya Ray, David Page: Why skewing works: learning difficult Boolean functions with greedy tree learners. ICML 2005: 728-735

Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks: Minimizing DNF Formulas and AC0 Circuits Given a Truth Table. Electronic Colloquium on Computational Complexity (ECCC)(126) (2005)

Bernard Rosell, Lisa Hellerstein: Naïve Bayes with Higher Order Attributes. Canadian Conference on AI 2004: 105-119

Lisa Hellerstein, Vijay Raghavan: Exact learning of DNF formulas using DNF hypotheses. STOC 2002: 465-473

Lisa Hellerstein: On generalized constraints and certificates. Discrete Mathematics 226(1-3): 211-232 (2001)

Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein: Equational characterizations of Boolean function classes. Discrete Mathematics 211: 27-51 (2000)

Joseph M. Hellerstein, Lisa Hellerstein, George Kollios: On the Generation of 2-Dimensional Index Workloads. ICDT 1999: 113-130

Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt: Complexity Theoretic Hardness Results for Query Learning. Computational Complexity 7(1): 19-53 (1998)

Aaron Feigelson, Lisa Hellerstein: Conjunctions of Unate DNF Formulas: Learning and Structure. Inf. Comput. 140(2): 203-228 (1998)

Nader H. Bshouty, Lisa Hellerstein: Attribute-Efficient Learning in Query and Mistake-Bound Models. J. Comput. Syst. Sci. 56(3): 310-319 (1998)

Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson: On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. SIAM J. Comput. 27(3): 739-762 (1998)

Aaron Feigelson, Lisa Hellerstein: The Forbidden Projections of Unate Functions. Discrete Applied Mathematics 77(3): 221-236 (1997)

Collette R. Coullard, Lisa Hellerstein: Independence and Port Oracles for Matroids, with an Application to Computational Learning Theory. Combinatorica 16(2): 189-208 (1996)

Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins: How Many Queries Are Needed to Learn? J. ACM 43(5): 840-862 (1996)

Nader H. Bshouty, Lisa Hellerstein: Attribute-Efficient Learning in Query and Mistake-Bound Models. COLT 1996: 235-243

Aaron Feigelson, Lisa Hellerstein: Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results. COLT 1996: 255-265

Avrim Blum, Lisa Hellerstein, Nick Littlestone: Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. J. Comput. Syst. Sci. 50(1): 32-40 (1995)

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein: Learning Boolean Read-Once Formulas over Generalized Bases. J. Comput. Syst. Sci. 50(3): 521-542 (1995)

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein: Learning Arithmetic Read-Once Formulas. SIAM J. Comput. 24(4): 706-735 (1995)

Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins: How many queries are needed to learn? STOC 1995: 190-199

Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz, David A. Patterson: Coding Techniques for Handling Failures in Large Disk Arrays. Algorithmica 12(2/3): 182-208 (1994)

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski: An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models. Computational Complexity 4: 37-61 (1994)

Lisa Hellerstein: Guest Editor's Introduction. Machine Learning 17(2-3): 111-114 (1994)

Aditi Dhagat, Lisa Hellerstein: PAC Learning with Irrelevant Attributes. FOCS 1994: 64-74

Lisa Hellerstein, Collette R. Coullard: Learning Binary Matroid Ports. SODA 1994: 328-335

Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson: On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). STOC 1994: 676-685

Lisa Hellerstein: Functions that are Read-Once on a Subset of their Inputs. Discrete Applied Mathematics 46(3): 235-251 (1993)

Dana Angluin, Lisa Hellerstein, Marek Karpinski: Learning Read-Once Formulas with Queries. J. ACM 40(1): 185-210 (1993)

Lisa Hellerstein: Book Review: "Machine Learning: A Theoretical Approach". Machine Learning 13: 145-149 (1993)

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein: Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. COLT 1992: 1-15

Howard Aizenstein, Lisa Hellerstein, Leonard Pitt: Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries. FOCS 1992: 523-532

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein: Learning Arithmetic Read-Once Formulas. STOC 1992: 370-381

Avrim Blum, Lisa Hellerstein, Nick Littlestone: Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. COLT 1991: 157-166

Thomas R. Hancock, Lisa Hellerstein: Learning Read-Once Formulas over Fields and Extended Bases. COLT 1991: 326-336

Lisa Hellerstein, Philip N. Klein, Robert Wilber: On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs. Inf. Process. Lett. 35(5): 261-267 (1990)

Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz, David A. Patterson: Failure Correction Techniques for Large Disk Arrays. ASPLOS 1989: 123-132

Lisa Hellerstein, Marek Karpinski: Learning Read-Once Formulas Using Membership Queries. COLT 1989: 146-161

Stephen Taylor, Lisa Hellerstein, Shmuel Safra, Ehud Y. Shapiro: Notes on the Complexity of Systolic Programs. J. Parallel Distrib. Comput. 4(3): 250-265 (1987)

Lisa Hellerstein, Ehud Y. Shapiro: Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. J. Log. Program. 3(2): 157-184 (1986)

Lisa Hellerstein, Ehud Y. Shapiro: Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. SLP 1984: 99-115