Boolean functions. Theory, algorithms, and applications. Zbl 1237.06001
|
|
2011
|
Learning read-once formulas with queries. Zbl 0764.68139
Angluin, Dana; Hellerstein, Lisa; Karpinski, Marek |
|
1993
|
Equational characterizations of Boolean function classes. Zbl 0947.06008
Ekin, Oya; Foldes, Stephan; Hammer, Peter L.; Hellerstein, Lisa |
|
2000
|
Minimizing disjunctive normal form formulas and \(\text{AC}^0\) circuits given a truth table. Zbl 1165.68030
Allender, Eric; Hellerstein, Lisa; McCabe, Paul; Pitassi, Toniann; Saks, Michael |
|
2008
|
How many queries are needed to learn? Zbl 0885.68123
Hellerstein, Lisa; Pillaipakkamnatt, Krishnan; Raghavan, Vijay; Wilkins, Dawn |
|
1996
|
Learning in the presence of finitely or infinitely many irrelevant attributes. Zbl 0826.68100
Blum, Avrim; Hellerstein, Lisa; Littlestone, Nick |
|
1995
|
Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack. Zbl 1421.68211
Deshpande, Amol; Hellerstein, Lisa; Kletenik, Devorah |
|
2016
|
On generalized constraints and certificates. Zbl 0965.06016
Hellerstein, Lisa |
|
2001
|
Independence and port oracles for matroids, with an application to computational learning theory. Zbl 0860.05019
Coullard, Collette R.; Hellerstein, Lisa |
|
1996
|
Learning Boolean read-once formulas over generalized bases. Zbl 0837.68087
Bshouty, Nader H.; Hancock, Thomas R.; Hellerstein, Lisa |
|
1995
|
Attribute-efficient learning in query and mistake-bound models. Zbl 0945.68530
Bshouty, Nader; Hellerstein, Lisa |
|
1998
|
On PAC learning algorithms for rich Boolean function classes. Zbl 1124.68052
Hellerstein, Lisa; Servedio, Rocco A. |
|
2007
|
Algorithms for distributional and adversarial pipelined filter ordering problems. Zbl 1445.68078
Condon, Anne; Deshpande, Amol; Hellerstein, Lisa; Wu, Ning |
|
2009
|
Coding techniques for handling failures in large disk arrays. Zbl 1338.68031
Hellerstein, L.; Gibson, G. A.; Karp, R. M.; Katz, R. H.; Patterson, D. A. |
|
1994
|
Approximation algorithms for stochastic Boolean function evaluation and stochastic submodular set cover. Zbl 1421.68212
Deshpande, Amol; Hellerstein, Lisa; Kletenik, Devorah |
|
2014
|
Complexity theoretic hardness results for query learning. Zbl 0903.68157
Aizenstein, Howard; Hegedűs, Tibor; Hellerstein, Lisa; Pitt, Leonard |
|
1998
|
Read-thrice DNF is hard to learn with membership and equivalence queries. (Extended abstract). Zbl 0977.68565
Aizenstein, Howard; Hellerstein, Lisa; Pitt, Leonard |
|
1992
|
The forbidden projections of unate functions. Zbl 0882.94030
Feigelson, Aaron; Hellerstein, Lisa |
|
1997
|
Learning read-once formulas using membership queries. Zbl 0747.68046
Hellerstein, Lisa; Karpinski, Marek |
|
1989
|
Evaluation of monotone DNF formulas. Zbl 1364.68221
Allen, Sarah R.; Hellerstein, Lisa; Kletenik, Devorah; Ünlüyurt, Tonguç |
|
2017
|
The stochastic score classification problem. Zbl 1524.68443
Gkenosis, Dimitrios; Grammel, Nathaniel; Hellerstein, Lisa; Kletenik, Devorah |
|
2018
|
Learning arithmetic read-once formulas. Zbl 0830.68107
Bshouty, Nader H.; Hancock, Thomas R.; Hellerstein, Lisa |
|
1995
|
Solving zero-sum games using best-response oracles with applications to search games. Zbl 1455.91015
Hellerstein, Lisa; Lidbetter, Thomas; Pirutinsky, Daniel |
|
2019
|
On the power of finite automata with both nondeterministic and probabilistic states. Zbl 0911.68049
Condon, Anne; Hellerstein, Lisa; Pottle, Samuel; Wigderson, Avi |
|
1998
|
Exact learning of DNF formulas using DNF hypotheses. Zbl 1192.68389
Hellerstein, Lisa; Raghavan, Vijay |
|
2002
|
Scenario submodular cover. Zbl 1484.90056
Grammel, Nathaniel; Hellerstein, Lisa; Kletenik, Devorah; Lin, Patrick |
|
2017
|
Discrete stochastic submodular maximization: adaptive vs. non-adaptive vs. offline. Zbl 1459.90136
Hellerstein, Lisa; Kletenik, Devorah; Lin, Patrick |
|
2015
|
Exact learning of DNF formulas using DNF hypotheses. Zbl 1073.68035
Hellerstein, Lisa; Raghavan, Vijay |
|
2005
|
Submodular goal value of Boolean functions. Zbl 1403.68340
Bach, Eric; Dusart, Jérémie; Hellerstein, Lisa; Kletenik, Devorah |
|
2018
|
Parallel pipelined filter ordering with precedence constraints. Zbl 1295.68106
Deshpande, Amol; Hellerstein, Lisa |
|
2012
|
How many queries are needed to learn? Zbl 0978.68561
Hellerstein, Lisa; Pillaipakkamnatt, Krishnan; Raghavan, Vijay; Wilkins, Dawn |
|
1995
|
An algorithm to learn read-once threshold formulas, and transformations between learning models. Zbl 0806.68050
Bshouty, Nader H.; Hancock, Thomas R.; Hellerstein, Lisa; Karpinski, Marek |
|
1994
|
The stochastic Boolean function evaluation problem for symmetric Boolean functions. Zbl 1533.68405
Gkenosis, Dimitrios; Grammel, Nathaniel; Hellerstein, Lisa; Kletenik, Devorah |
|
2022
|
A general framework for approximating min sum ordering problems. Zbl 07552216
Happach, Felix; Hellerstein, Lisa; Lidbetter, Thomas |
|
2022
|
Revisiting the approximation bound for stochastic submodular cover. Zbl 1451.68351
Hellerstein, Lisa; Kletenik, Devorah |
|
2018
|
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). Zbl 1345.68203
Condon, Anne; Hellerstein, Lisa; Pottle, Samuel; Wigderson, Avi |
|
1994
|
A tight bound for stochastic submodular cover. Zbl 1519.68318
Hellerstein, Lisa; Kletenik, Devorah; Parthasarathy, Srinivasan |
|
2021
|
Learning binary matroid ports. Zbl 0876.68093
Hellerstein, Lisa; Coullard, Collette |
|
1994
|
Implementing parallel algorithms in Concurrent Prolog: the MAXFLOW experience. Zbl 0613.68015
Hellerstein, Lisa; Shapiro, Ehud |
|
1986
|
Conjunctions of unate DNF formulas: Learning and structure. Zbl 0895.68128
Feigelson, Aaron; Hellerstein, Lisa |
|
1998
|
Algorithms for the unit-cost stochastic score classification problem. Zbl 1524.68445
Grammel, Nathaniel; Hellerstein, Lisa; Kletenik, Devorah; Liu, Naifeng |
|
2022
|
Adaptivity gaps for the stochastic Boolean function evaluation problem. Zbl 07717064
Hellerstein, Lisa; Kletenik, Devorah; Liu, Naifeng; Witter, R. Teal |
|
2022
|
Max-throughput for (conservative) \(k\)-of-\(n\) testing. Zbl 1359.68134
Hellerstein, Lisa; Özkan, Özgür; Sellie, Linda |
|
2017
|
The stochastic Boolean function evaluation problem for symmetric Boolean functions. Zbl 1533.68405
Gkenosis, Dimitrios; Grammel, Nathaniel; Hellerstein, Lisa; Kletenik, Devorah |
|
2022
|
A general framework for approximating min sum ordering problems. Zbl 07552216
Happach, Felix; Hellerstein, Lisa; Lidbetter, Thomas |
|
2022
|
Algorithms for the unit-cost stochastic score classification problem. Zbl 1524.68445
Grammel, Nathaniel; Hellerstein, Lisa; Kletenik, Devorah; Liu, Naifeng |
|
2022
|
Adaptivity gaps for the stochastic Boolean function evaluation problem. Zbl 07717064
Hellerstein, Lisa; Kletenik, Devorah; Liu, Naifeng; Witter, R. Teal |
|
2022
|
A tight bound for stochastic submodular cover. Zbl 1519.68318
Hellerstein, Lisa; Kletenik, Devorah; Parthasarathy, Srinivasan |
|
2021
|
Solving zero-sum games using best-response oracles with applications to search games. Zbl 1455.91015
Hellerstein, Lisa; Lidbetter, Thomas; Pirutinsky, Daniel |
|
2019
|
The stochastic score classification problem. Zbl 1524.68443
Gkenosis, Dimitrios; Grammel, Nathaniel; Hellerstein, Lisa; Kletenik, Devorah |
|
2018
|
Submodular goal value of Boolean functions. Zbl 1403.68340
Bach, Eric; Dusart, Jérémie; Hellerstein, Lisa; Kletenik, Devorah |
|
2018
|
Revisiting the approximation bound for stochastic submodular cover. Zbl 1451.68351
Hellerstein, Lisa; Kletenik, Devorah |
|
2018
|
Evaluation of monotone DNF formulas. Zbl 1364.68221
Allen, Sarah R.; Hellerstein, Lisa; Kletenik, Devorah; Ünlüyurt, Tonguç |
|
2017
|
Scenario submodular cover. Zbl 1484.90056
Grammel, Nathaniel; Hellerstein, Lisa; Kletenik, Devorah; Lin, Patrick |
|
2017
|
Max-throughput for (conservative) \(k\)-of-\(n\) testing. Zbl 1359.68134
Hellerstein, Lisa; Özkan, Özgür; Sellie, Linda |
|
2017
|
Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack. Zbl 1421.68211
Deshpande, Amol; Hellerstein, Lisa; Kletenik, Devorah |
|
2016
|
Discrete stochastic submodular maximization: adaptive vs. non-adaptive vs. offline. Zbl 1459.90136
Hellerstein, Lisa; Kletenik, Devorah; Lin, Patrick |
|
2015
|
Approximation algorithms for stochastic Boolean function evaluation and stochastic submodular set cover. Zbl 1421.68212
Deshpande, Amol; Hellerstein, Lisa; Kletenik, Devorah |
|
2014
|
Parallel pipelined filter ordering with precedence constraints. Zbl 1295.68106
Deshpande, Amol; Hellerstein, Lisa |
|
2012
|
Boolean functions. Theory, algorithms, and applications. Zbl 1237.06001
|
|
2011
|
Algorithms for distributional and adversarial pipelined filter ordering problems. Zbl 1445.68078
Condon, Anne; Deshpande, Amol; Hellerstein, Lisa; Wu, Ning |
|
2009
|
Minimizing disjunctive normal form formulas and \(\text{AC}^0\) circuits given a truth table. Zbl 1165.68030
Allender, Eric; Hellerstein, Lisa; McCabe, Paul; Pitassi, Toniann; Saks, Michael |
|
2008
|
On PAC learning algorithms for rich Boolean function classes. Zbl 1124.68052
Hellerstein, Lisa; Servedio, Rocco A. |
|
2007
|
Exact learning of DNF formulas using DNF hypotheses. Zbl 1073.68035
Hellerstein, Lisa; Raghavan, Vijay |
|
2005
|
Exact learning of DNF formulas using DNF hypotheses. Zbl 1192.68389
Hellerstein, Lisa; Raghavan, Vijay |
|
2002
|
On generalized constraints and certificates. Zbl 0965.06016
Hellerstein, Lisa |
|
2001
|
Equational characterizations of Boolean function classes. Zbl 0947.06008
Ekin, Oya; Foldes, Stephan; Hammer, Peter L.; Hellerstein, Lisa |
|
2000
|
Attribute-efficient learning in query and mistake-bound models. Zbl 0945.68530
Bshouty, Nader; Hellerstein, Lisa |
|
1998
|
Complexity theoretic hardness results for query learning. Zbl 0903.68157
Aizenstein, Howard; Hegedűs, Tibor; Hellerstein, Lisa; Pitt, Leonard |
|
1998
|
On the power of finite automata with both nondeterministic and probabilistic states. Zbl 0911.68049
Condon, Anne; Hellerstein, Lisa; Pottle, Samuel; Wigderson, Avi |
|
1998
|
Conjunctions of unate DNF formulas: Learning and structure. Zbl 0895.68128
Feigelson, Aaron; Hellerstein, Lisa |
|
1998
|
The forbidden projections of unate functions. Zbl 0882.94030
Feigelson, Aaron; Hellerstein, Lisa |
|
1997
|
How many queries are needed to learn? Zbl 0885.68123
Hellerstein, Lisa; Pillaipakkamnatt, Krishnan; Raghavan, Vijay; Wilkins, Dawn |
|
1996
|
Independence and port oracles for matroids, with an application to computational learning theory. Zbl 0860.05019
Coullard, Collette R.; Hellerstein, Lisa |
|
1996
|
Learning in the presence of finitely or infinitely many irrelevant attributes. Zbl 0826.68100
Blum, Avrim; Hellerstein, Lisa; Littlestone, Nick |
|
1995
|
Learning Boolean read-once formulas over generalized bases. Zbl 0837.68087
Bshouty, Nader H.; Hancock, Thomas R.; Hellerstein, Lisa |
|
1995
|
Learning arithmetic read-once formulas. Zbl 0830.68107
Bshouty, Nader H.; Hancock, Thomas R.; Hellerstein, Lisa |
|
1995
|
How many queries are needed to learn? Zbl 0978.68561
Hellerstein, Lisa; Pillaipakkamnatt, Krishnan; Raghavan, Vijay; Wilkins, Dawn |
|
1995
|
Coding techniques for handling failures in large disk arrays. Zbl 1338.68031
Hellerstein, L.; Gibson, G. A.; Karp, R. M.; Katz, R. H.; Patterson, D. A. |
|
1994
|
An algorithm to learn read-once threshold formulas, and transformations between learning models. Zbl 0806.68050
Bshouty, Nader H.; Hancock, Thomas R.; Hellerstein, Lisa; Karpinski, Marek |
|
1994
|
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). Zbl 1345.68203
Condon, Anne; Hellerstein, Lisa; Pottle, Samuel; Wigderson, Avi |
|
1994
|
Learning binary matroid ports. Zbl 0876.68093
Hellerstein, Lisa; Coullard, Collette |
|
1994
|
Learning read-once formulas with queries. Zbl 0764.68139
Angluin, Dana; Hellerstein, Lisa; Karpinski, Marek |
|
1993
|
Read-thrice DNF is hard to learn with membership and equivalence queries. (Extended abstract). Zbl 0977.68565
Aizenstein, Howard; Hellerstein, Lisa; Pitt, Leonard |
|
1992
|
Learning read-once formulas using membership queries. Zbl 0747.68046
Hellerstein, Lisa; Karpinski, Marek |
|
1989
|
Implementing parallel algorithms in Concurrent Prolog: the MAXFLOW experience. Zbl 0613.68015
Hellerstein, Lisa; Shapiro, Ehud |
|
1986
|