| Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover A Deshpande, L Hellerstein, D Kletenik Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discrete …, 2014 | 61 | 2014 |
| Approximation algorithms for stochastic submodular set cover with applications to boolean function evaluation and min-knapsack A Deshpande, L Hellerstein, D Kletenik ACM Transactions on Algorithms (TALG) 12 (3), 1-28, 2016 | 32 | 2016 |
| Evaluating instructor strategy and student learning through digital accessibility course enhancements C Kearney-Volpe, D Kletenik, K Sonka, D Sturm, A Hurst Proceedings of the 21st International ACM SIGACCESS Conference on Computers …, 2019 | 31 | 2019 |
| Evaluation of monotone DNF formulas SR Allen, L Hellerstein, D Kletenik, T Ünlüyurt Algorithmica 77, 661-685, 2017 | 24 | 2017 |
| Scenario submodular cover N Grammel, L Hellerstein, D Kletenik, P Lin International Workshop on Approximation and Online Algorithms, 116-128, 2016 | 18 | 2016 |
| Let's Play: Increasing Accessibility Awareness and Empathy Through Games D Kletenik, RF Adler Proceedings of the 53rd ACM Technical Symposium on Computer Science …, 2022 | 11 | 2022 |
| The Stochastic Score Classification Problem D Gkenosis, N Grammel, L Hellerstein, D Kletenik 26th Annual European Symposium on Algorithms (ESA 2018) 112, 36:1--36:14, 2018 | 11 | 2018 |
| Discrete stochastic submodular maximization: Adaptive vs. non-adaptive vs. offline L Hellerstein, D Kletenik, P Lin International Conference on Algorithms and Complexity, 235-248, 2015 | 11 | 2015 |
| Evaluation of DNF formulas SR Allen, L Hellerstein, D Kletenik, T Ünlüyurt arXiv preprint arXiv:1310.3673, 2013 | 11 | 2013 |
| Submodular goal value of boolean functions E Bach, J Dusart, L Hellerstein, D Kletenik Discrete Applied Mathematics 238, 1-13, 2018 | 7 | 2018 |
| Game on: teaching cybersecurity to novices through the use of a serious game D Kletenik, A Butbul, D Chan, D Kwok, M LaSpina Journal of Computing Sciences in Colleges 36 (8), 11-21, 2021 | 6 | 2021 |
| Revisiting the approximation bound for stochastic submodular cover L Hellerstein, D Kletenik Journal of Artificial Intelligence Research 63, 265-279, 2018 | 6 | 2018 |
| Algorithms for the unit-cost stochastic score classification problem N Grammel, L Hellerstein, D Kletenik, N Liu Algorithmica 84 (10), 3054-3074, 2022 | 5 | 2022 |
| Cyber secured: A serious game for cybersecurity novices D Kletenik, A Butbul, D Chan, D Kwok, M LaSpina Proceedings of the 51st ACM Technical Symposium on Computer Science …, 2020 | 5 | 2020 |
| Game development with a serious focus D Kletenik, D Sturm Proceedings of the 49th ACM Technical Symposium on Computer Science …, 2018 | 5 | 2018 |
| A serious game to teach computing concepts D Kletenik, F Salinas, C Shulman, C Bergeron, D Sturm HCI International 2017–Posters' Extended Abstracts: 19th International …, 2017 | 5 | 2017 |
| Tight bounds on proper equivalence query learning of DNF L Hellerstein, D Kletenik, L Sellie, R Servedio Conference on Learning Theory, 31.1-31.18, 2012 | 5 | 2012 |
| The stochastic boolean function evaluation problem for symmetric boolean functions D Gkenosis, N Grammel, L Hellerstein, D Kletenik Discrete Applied Mathematics 309, 269-277, 2022 | 4 | 2022 |
| A tight bound for stochastic submodular cover L Hellerstein, D Kletenik, S Parthasarathy Journal of Artificial Intelligence Research 71, 347-370, 2021 | 4 | 2021 |
| Who Wins? A Comparison of Accessibility Simulation Games vs. Classroom Modules D Kletenik, RF Adler Proceedings of the 54th ACM Technical Symposium on Computer Science …, 2023 | 3 | 2023 |
