Journal articles:

• Accessibility for All: Introducing IT Accessibility in Postsecondary Computer Science Programs for K-12 Teachers. With Rachel F. Adler. Journal of Postsecondary Education & Disability , 36(1), 2023.
• Algorithms for the Unit-Cost Stochastic Score Classification Problem. With Nathaniel Grammel, Lisa Hellerstein, and Naifeng Liu. Algorithmica , 84(10), 3054-3074, 2022.
• The Stochastic Boolean Function Evaluation Problem for Symmetric Boolean Functions. With Dimitrios Gkenosis, Nathaniel Grammel, and Lisa Hellerstein. Discrete Applied Mathematics 309, 269-277, 2022.
• A Tight Bound for Stochastic Submodular Cover. With Lisa Hellerstein and Srinivasan Parthasarathy. Journal of Artificial Intelligence Research , 71, 347-370, 2021.
• Revisiting the Approximation Bound for Stochastic Submodular Cover. With Lisa Hellerstein. Journal of Artificial Intelligence Research , 63 (265 - 279), 2018.
• Submodular Goal Value of Boolean Functions. With Eric Bach, Jeremie Dusart, and Lisa Hellerstein. Discrete Applied Mathematics, 238 (1 - 13), 2018.
• Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack. With Amol Deshpande and Lisa Hellerstein. ACM Transactions on Algorithms 12 (3): (1-28), 2016.
• Evaluation of Monotone DNF Formulas. With Sarah Allen, Lisa Hellerstein, and Tonguc Unluyurt. Algorithmica, 77:3 (661 - 685), 2015.
• On the Gap Between ess(f) and cnf_size(f). With Lisa Hellerstein. Discrete Applied Mathematics 161 (19-27), 2013.

Conference Publications:

• Who Wins? A Comparison of Accessibility Simulation Games vs. Classroom Modules With Rachel F. Adler. Proceedings of the 54th ACM Technical Symposium on Computer Science Education (SIGCSE) - Volume 1 , (pp.214-220), 2023.
• Let's Play: Increasing Accessibility Awareness and Empathy Through Games. With Rachel F. Adler. Proceedings of the 53rd ACM Technical Symposium on Computer Science Education (SIGCSE) - Volume 1 (pp. 182 - 188), 2022.
• Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem. With Lisa Hellerstein, Naifeng Liu and R. Teal Witter. International Workshop on Approximation and Online Algorithms (pp. 190 - 210), 2022.
• Game On: Teaching Cybersecurity to Novices Through the Use of a Serious Game. With Alon Butbul, Daniel Chan, Deric Kwok and Matthew LaSpina. Consortium for Computing Sciences in Colleges Northeast Region (CCSC-NE), 2021.
• Evaluating Instructor Strategy and Student Learning through Digital Accessibility Course Enhancements. With Claire Kearney-Volpe, Kate Sonka, Deborah Sturm and Amy Hurst. ACM SIGACCESS Conference on Computers and Accessibility (ASSETS), 2019.
• Possible Bias Against Algorithmic (AI) Music. Supervisor for Alyssa Caputo, National Conference on Undergraduate Research (NCUR), 2018.
• Symmetric Boolean Function Evaluation. With Dimitrios Gkenosis, Nathaniel Grammel, and Lisa Hellerstein. European Symposium on Algorithms (ESA), 2018.
• Game Development with a Serious Focus. With Deborah Sturm. Technical Symposium on Computer Science Education (SIGCSE), 2018.
• Scenario Submodular Cover. With Nathaniel Grammel, Lisa Hellerstein, and Patrick Lin. International Workshop on Approximation and Online Algorithms (WAOA) , 2016.
• Discrete Submodular Stochastic Maximization: Adaptive vs. Non-Adaptive vs. Offline. With Lisa Hellerstein and Patrick Lin. International Conference on Algorithms and Complexity (CIAC), 2015.
• Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover. With Amol Deshpande and Lisa Hellerstein. Symposium on Discrete Algorithms (SODA), 2014.
• Tight Bounds on Proper Equivalence Query Learning of DNF. With Lisa Hellerstein, Linda Sellie, and Rocco A. Servedio. Journal of Machine Learning Research -- Proceedings on the 25th Annual Conference of Learning Theory, 2012.
• Computer-Aided Tracking of MS Lesions. With Deborah Sturm and Philip Koshy. SPIE Medical Imaging. International Society for Optics and Photonics, 2011.

Peer-Reviewed Workshop Papers:

• Cyber Secured: A Serious Game for Cybersecurity Novices. With Alon Butbul, Daniel Chan, Deric Kwok and Matthew LaSpina. Poster Session at Technical Symposium on Computer Science Eduation (SIGCSE), 2020.
• A Game-Changing Instructor Tool to Reinforce Coding Concepts. With Deborah Sturm. Poster Session at Technical Symposium on Computer Science Eduation (SIGCSE), 2020.
• Code Control: Developing a Serious Game to Reinforce Introductory Programming Concepts. With Deborah Sturm. International Information Management Association (IIMA), 2019.
• Game Development with a Serious Focus. With Deborah Sturm. CUNY Games Conference 4.0, 2018.
• Revisiting the Approximation Bound for Stochastic Submodular Cover. With Lisa Hellerstein. Discrete Structures in Machine Learning (DISCML) , 2017.
• A Serious Game to Teach Computing Concepts. With Florencia Salinas, Chava Shulman, Claudia Bergeron and Deborah Sturm. International Conference on Human-Computer Interaction , 2017.
• On the Goal Value of a Boolean Function. With Eric Bach and Lisa Hellerstein. International Symposium on Artificial Intelligence and Mathematics (ISAIM), 2016.
• Boolean Function Evaluation over a Sample. With Lisa Hellerstein and Patrick Lin. NIPS Workshop on Discrete and Combinatorial Problems in Machine Learning (DISCML), 2014.
• Evaluation of DNF Formulas. With Sarah Allen, Lisa Hellerstein, and Tonguc Unluyurt. International Symposium on Artificial Intelligence and Mathematics (ISAIM), 2014.
• Adaptive Dual Greedy: Using an LTF Evaluation Algorithm to Reduce the Costs of Using SVM. With Lisa Hellerstein. ICML Workshop on Learning with Test-time Budgets , 2013.
• On the gap between ess(f) and cnf_size(f). WIth Lisa Hellerstein. International Symposium on Artificial Intelligence and Mathematics (ISAIM), 2012.