Generate a tailored SOP for Dr. Lisa Hellerstein. Improve your application with a focused, well-structured draft.
Lisa Hellerstein is a Professor at NYU Tandon School of Engineering specializing in approximation algorithms, stochastic combinatorial optimization, machine learning theory, boolean functions, and complexity theory. She completed her A.B. at Harvard University in 1984 and obtained her Ph.D. from the University of California at Berkeley in 1989. Over the years, Hellerstein has contributed significantly to various research areas, publishing numerous papers that explore the mathematical foundations of algorithms and optimization techniques. Her work has appeared in prestigious journals and conferences including the INFORMS Journal of Computing and the ACM Transactions on Algorithms. Hellerstein's research has focused on critical problems in approximation algorithms including the min-sum ordering problems, stochastic score classification problems, and evaluating stochastic boolean functions. She is an active member of the Algorithms Foundations Group at NYU, engaging in research to further the understanding of algorithmic theory and its applications.
New York University Tandon School of Engineering • New York, NY
Teaching and research in the field of Computer Science specializing in algorithms and optimization.
Administered by the Department of Electrical and Computer Engineering.