| 2026 | SODA | Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation. | Lisa Hellerstein, Benedikt M. Plank, Kevin Schewior |
| 2026 | STACS | Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid. | Haya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlter |
| 2022 | ISAAC | A Local Search Algorithm for the Min-Sum Submodular Cover Problem. | Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter |
| 2022 | ISAIM | A general framework for approximating min sum ordering problems. | Felix Happach, Lisa Hellerstein, Thomas Lidbetter |
| 2022 | ISAIM | Adaptivity gap of the SBFE problem. | Lisa Hellerstein, Devorah Kletenik, Naifeng Liu, R. Teal Witter |
| 2022 | WAOA | Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem. | Lisa Hellerstein, Devorah Kletenik, Naifeng Liu, R. Teal Witter |
| 2018 | ESA | The Stochastic Score Classification Problem. | Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik |
| 2018 | ICMLA | Recursive Feature Elimination by Sensitivity Testing. | Nicholas Sean Escanilla, Lisa Hellerstein, Ross Kleiman, Zhaobin Kuang, James Shull, David Page |
| 2018 | ISAIM | Stochastic Evaluation of Symmetric Boolean Functions. | Lisa Hellerstein |
| 2016 | ISAIM | On the Goal Value of a Boolean Function. | Eric Bach, Lisa Hellerstein, Devorah Kletenik |
| 2016 | WAOA | Scenario Submodular Cover. | Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin |
| 2015 | CIAC | Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline. | Lisa Hellerstein, Devorah Kletenik, Patrick Lin |
| 2014 | ISAIM | Evaluation of DNF Formulas. | Sarah R. Allen, Lisa Hellerstein, Devorah Kletenik, Tongu nlyurt |
| 2014 | SODA | Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover. | Amol Deshpande, Lisa Hellerstein, Devorah Kletenik |
| 2012 | ISAIM | On the gap between ess(f) and cnf_size(f). | Lisa Hellerstein, Devorah Kletenik |
| 2011 | ISAAC | Max-Throughput for (Conservative) k-of-n Testing. | Lisa Hellerstein, zgr zkan, Linda Sellie |
| 2008 | ICDE | Flow Algorithms for Parallel Query Optimization. | Amol Deshpande, Lisa Hellerstein |
| 2006 | PODS | Flow algorithms for two pipelined filter ordering problems. | Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu |
| 2005 | ECIR | On Compression-Based Text Classification. | Yuval Marton, Ning Wu, Lisa Hellerstein |
| 2005 | ICML | Why skewing works: learning difficult Boolean functions with greedy tree learners. | Bernard Rosell, Lisa Hellerstein, Soumya Ray, David Page |
| 2004 | AI | Nave Bayes with Higher Order Attributes. | Bernard Rosell, Lisa Hellerstein |
| 2002 | STOC | Exact learning of DNF formulas using DNF hypotheses. | Lisa Hellerstein, Vijay Raghavan |
| 1999 | ICDT | On the Generation of 2-Dimensional Index Workloads. | Joseph M. Hellerstein, Lisa Hellerstein, George Kollios |
| 1996 | COLT | Attribute-Efficient Learning in Query and Mistake-Bound Models. | Nader H. Bshouty, Lisa Hellerstein |
| 1996 | COLT | Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results. | Aaron Feigelson, Lisa Hellerstein |
| 1995 | STOC | How many queries are needed to learn? | Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan, Dawn Wilkins |
| 1994 | FOCS | PAC Learning with Irrelevant Attributes | Aditi Dhagat, Lisa Hellerstein |
| 1994 | SODA | Learning Binary Matroid Ports. | Lisa Hellerstein, Collette R. Coullard |
| 1994 | STOC | On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). | Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson |
| 1992 | COLT | Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein |
| 1992 | FOCS | Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries | Howard Aizenstein, Lisa Hellerstein, Leonard Pitt |
| 1992 | STOC | Learning Arithmetic Read-Once Formulas | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein |
| 1991 | COLT | Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. | Avrim Blum, Lisa Hellerstein, Nick Littlestone |
| 1991 | COLT | Learning Read-Once Formulas over Fields and Extended Bases. | Thomas R. Hancock, Lisa Hellerstein |
| 1989 | ASPLOS | Failure Correction Techniques for Large Disk Arrays. | Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz, David A. Patterson |
| 1989 | COLT | Learning Read-Once Formulas Using Membership Queries. | Lisa Hellerstein, Marek Karpinski |