☰

Lisa Hellerstein - Publications

Affiliations: 
Computer Science and Engineering Polytechnic Institute of New York University, Brooklyn, NY, NY, United States 
Area:
Computer Science, Computer Engineering, General Engineering
Tree Info Similar researchers PubMed Report error

11 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Deshpande A, Hellerstein L, Kletenik D. Approximation algorithms for stochastic submodular set cover with applications to boolean function evaluation and min-knapsack Acm Transactions On Algorithms. 12. DOI: 10.1145/2876506  0.723
2015 Allen SR, Hellerstein L, Kletenik D, Ünlüyurt T. Evaluation of Monotone DNF Formulas Algorithmica. 1-25. DOI: 10.1007/s00453-015-0092-9  0.67
2015 Hellerstein L, Kletenik D, Lin P. 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. DOI: 10.1007/978-3-319-18173-8_17  0.694
2014 Deshpande A, Hellerstein L, Kletenik D. Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1453-1467.  0.72
2013 Hellerstein L, Kletenik D. On the gap between ess(f) and cnf -size(f) Discrete Applied Mathematics. 161: 19-27. DOI: 10.1016/j.dam.2012.07.004  0.694
2012 Hellerstein L, Kletenik D. On the gap between ess(f) and cnf fisize(f) (extended abstract) International Symposium On Artificial Intelligence and Mathematics, Isaim 2012.  0.694
2012 Hellerstein L, Kletenik D, Sellie L, Servedio R. Tight bounds on proper equivalence query learning of DNF Journal of Machine Learning Research. 23.  0.7
1996 Coullard CR, Hellerstein L. Independence and port oracles for matroids, with an application to computational learning theory Combinatorica. 16: 189-208.  0.314
1994 Bshouty NH, Hancock TR, Hellerstein L, Karpinski M. An algorithm to learn read-once threshold formulas, and transformations between learning models Computational Complexity. 4: 37-61. DOI: 10.1007/BF01205054  0.307
1993 Angluin D, Hellerstein L, Karpinski M. Learning read-once formulas with queries Journal of the Acm. 40: 185-210. DOI: 10.1145/138027.138061  0.327
1993 Hellerstein L. Functions that are read-once on a subset of their inputs Discrete Applied Mathematics. 46: 235-251. DOI: 10.1016/0166-218X(93)90105-W  0.308
Show low-probability matches.