Lisa Hellerstein

Lisa Hellerstein is a Professor in the Department of Computer Science and Engineering at the NYU Tandon School of Engineering. She holds an A.B. from Harvard University (1984) and a Ph.D. from the University of California, Berkeley (1989). Her research focuses on Approximation Algorithms, Stochastic Combinatorial Optimization, Machine Learning Theory, Boolean Functions, and Computational Complexity.

Her work spans theoretical computer science with contributions to algorithmic efficiency, stochastic decision-making, and discrete mathematics. Notable publications include advancements in min-sum ordering problems, stochastic score classification, and approximation algorithms for Boolean function evaluation. She is affiliated with the Algorithms and Foundations Group at NYU Tandon, contributing to projects like 'Minimum Cost Strategies for Sequential Search and Evaluation' and 'Robust Uncertain Data Management.'

Her research has appeared in top venues such as ITCS, ESA, SODA, and SIAM Journal on Computing, with a focus on theoretical guarantees and practical algorithmic solutions. She has advised numerous graduate students and holds grants related to computational learning and optimization frameworks.