Devorah Kletenik, Ph.D. - Publications
Affiliations: | 2014 | Computer Science and Engineering | Polytechnic Institute of New York University, Brooklyn, NY, NY, United States |
Area:
Computer Science, Computer Engineering, General EngineeringYear | 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.632 | |||
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.545 | |||
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.584 | |||
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.628 | |||
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.586 | |||
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.586 | |||
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.594 | |||
Show low-probability matches. |