Biographical Details
Esty Kelman has joined MIT-Kalaniyot as a postdoctoral researcher with MIT Mathematics and CSAIL. She was previously a postdoctoral fellow at CS and CDS at Boston University and CSAIL, MIT. She was partially supported by FODSI and hosted by Piotr Indyk, Krzysztof Onak, Sofya Raskhodnikova, and Ronitt Rubinfeld. Prior to this, she held a postdoctoral position at Reichmann University and the HUJI hosted by Gil Kalai. Muli Safra advised her at the Theory of Computation Group at Tel-Aviv University for her Ph.D., which focused on the analysis of Boolean functions.
Research Interests
Esty Kelman’s research interests are in theoretical computer science, including computational complexity, probabilistically checkable proofs, and sublinear algorithms, alongside the analysis of Boolean functions and combinatorics. Her research focuses on understanding the global and local structures of mathematical objects, such as multivariate functions or graphs, to deepen insights into computational complexity theory. It employs analytical and combinatorial tools to tackle questions such as: Can one learn nontrivial information about the global structure of an object by examining only a small part of it? Can the global structure be inferred from a local, possibly unstructured, view?
Select Publications
Filmus, Y., Hatami, H., Hosseini, K., & Kelman, E. (2024, October). Sparse graph counting and kelley-meka bounds for binary systems. In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) (pp. 1559-1578). IEEE.
Ben-Eliezer, O., Kelman, E., Meir, U., & Raskhodnikova, S. (2024). Property Testing with Online Adversaries. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) (pp. 11-1). Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
Arora, V., Bhattacharyya, A., Fleming, N., Kelman, E., & Yoshida, Y. (2023). Low degree testing over the reals. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 738-792). Society for Industrial and Applied Mathematics.
Kelman, E., Kindler, G., Lifshitz, N., Minzer, D., & Safra, M. (2020). Towards a proof of the Fourier-entropy conjecture?. Geometric and Functional Analysis, 30(4), 1097-1138.