Lisa Hellerstein
Affiliations: | Computer Science and Engineering | Polytechnic Institute of New York University, Brooklyn, NY, NY, United States |
Area:
Computer Science, Computer Engineering, General EngineeringGoogle:
"Lisa Hellerstein"Children
Sign in to add trainee| Devorah Kletenik | grad student | 2014 | Polytechnic Institute of New York University |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Deshpande A, Hellerstein L, Kletenik D. (2016) Approximation algorithms for stochastic submodular set cover with applications to boolean function evaluation and min-knapsack Acm Transactions On Algorithms. 12 |
| Allen SR, Hellerstein L, Kletenik D, et al. (2015) Evaluation of Monotone DNF Formulas Algorithmica. 1-25 |
| Hellerstein L, Kletenik D, Lin P. (2015) Discrete stochastic submodular maximization: Adaptive vs. non-adaptive vs. offline Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9079: 235-248 |
| Deshpande A, Hellerstein L, Kletenik D. (2014) Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1453-1467 |
| Hellerstein L, Kletenik D. (2013) On the gap between ess(f) and cnf -size(f) Discrete Applied Mathematics. 161: 19-27 |
| Hellerstein L, Kletenik D. (2012) On the gap between ess(f) and cnf fisize(f) (extended abstract) International Symposium On Artificial Intelligence and Mathematics, Isaim 2012 |
| Hellerstein L, Kletenik D, Sellie L, et al. (2012) Tight bounds on proper equivalence query learning of DNF Journal of Machine Learning Research. 23 |
| Coullard CR, Hellerstein L. (1996) Independence and port oracles for matroids, with an application to computational learning theory Combinatorica. 16: 189-208 |
| Bshouty NH, Hancock TR, Hellerstein L, et al. (1994) An algorithm to learn read-once threshold formulas, and transformations between learning models Computational Complexity. 4: 37-61 |
| Angluin D, Hellerstein L, Karpinski M. (1993) Learning read-once formulas with queries Journal of the Acm. 40: 185-210 |