Esty Kelman

Esty Kelman is a Research Fellow jointly affiliated with the Massachusetts Institute of Technology (CSAIL) and Boston University, working in theoretical computer science. Her research focuses on computational complexity, sublinear algorithms, property testing, and Boolean function analysis. She was previously a PhD student at Tel Aviv University advised by Muli Safra and participated in the Simons Institute's Causality program at UC Berkeley.

Her work has been recognized through the Simons Research Fellowship. Research interests span probabilistically checkable proofs, combinatorics, and adversarial models in algorithm design.

Publications demonstrate consistent focus on theoretical computer science foundations, with recent advances in property testing methods and combinatorial mathematics. Collaborative work frequently appears in top venues including FOCS, ITCS, and SODA.