Esty Kelman
ekelman@mit.edu
Postdoctoral fellow at CS and CDS at Boston University and CSAIL, MIT.
Supported in part by FODSI and hosted by Piotr Indyk, Krzysztof Onak, Sofya Raskhodnikova, and Ronitt Rubinfeld.
Research interests: Theoretical computer science, include computational complexity, probabilistically checkable proofs, and sublinear algorithms, in particular, property testing, alongside analysis of Boolean functions, and combinatorics.
Previously:
Publications

Sparse graph counting and KelleyMeka bounds for binary systems,
with Yuval Filmus, Hamed Hatami, and Kaave Hosseini.
To appear in the proceedings of the 65th IEEE Symposium on Foundations of Computer Science (FOCS), 2024.

Outlier robust multivariate polynomial regression,
with Vipul Arora, Arnab Bhattacharyya, Mathews Boban, and Venkatesan Guruswami.
To appear in the proceedings of the European Symposium on Algorithms (ESA), 2024.

Property testing with online adversaries,
with Omri BenEliezer, Uri Meir, and Sofya Raskhodnikova.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference (ITCS), 2024.

Low degree testing over the reals,
with Vipul Arora, Arnab Bhattacharyya, Noah Fleming, and Yuichi Yoshida.
Proceedings of the annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2023.

Theorems of KKL, Friedgut, and Talagrand via random restrictions and LogSobolev inequality,
with Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference (ITCS), 2021.

Towards a proof of the Fourierentropy conjecture?,
with Guy Kindler, Noam Lifshitz, Dor Minzer, and Muli Safra.
GAFA Geometric And Functional Analysis vol. 30, 2020.
Preliminary version appeared in the proceedings of the 52nd Annual IEEE Symposium on
Foundations of Computer Science (FOCS), 2020.