MIT-Kalaniyot Postdoctoral Associate at the Department of Mathematics and CSAIL.
Also affiliated as a Visiting Scientist at Boston University.

Research interests: My research is primarily in theoretical computer science. My interests include computational complexity, probabilistically checkable proofs, and sublinear algorithms, in particular property testing, as well as analysis of Boolean functions and combinatorics.

• 2023-2025: Postdoctoral fellow in a joint appointment at Boston University and MIT CSAIL. Supported in part by FODSI and hosted by Piotr Indyk, Krzysztof Onak, Sofya Raskhodnikova, and Ronitt Rubinfeld.
• Summer 2023: Simons research fellow for the program Analysis and TCS.
• 2022: Postdoc at Reichmann University and the HUJI hosted by Gil Kalai.
• Spring 2022: Participant of the Causality program at Simons Institute at UCB as part of  Arnab Bhattacharyya's group. 
• 2018 - 2022: Ph.D. student at the Theory of Computation Group at TAU, advised by Muli Safra. 

Publications

• Forbidden intersection theorems for matrix spaces, with Nathan Lindzey and Ohad Sheinfeld.
  Preprint, 2026.


• Robust approximate nearest neighbor search for any dataset, with Alexandr Andoni, Themistoklis Haris, and Krzysztof Onak.
  To appear in the proceedings of the 40th Annual Conference on Neural Information Processing Systems (NeurIPS), 2026.
  Preliminary version appeared at the NeurIPS 2025 Workshop on Reliable Machine Learning from Unreliable Data.


• Homomorphism testing with resilience to online manipulations, with Uri Meir, Debanuj Nayak, and Sofya Raskhodnikova.
  Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2026.


• Optimal testing of Reed-Muller codes with an online adversary, with Uri Meir and Kai Zhe Zheng.
  Proceedings of the 41st Computational Complexity Conference (CCC), 2026.


• Online versus offline adversaries in property testing, with Ephraim Linder and Sofya Raskhodnikova.
  Proceedings of the 16th Innovations in Theoretical Computer Science Conference (ITCS), 2025.


• On optimal testing of linearity, with Vipul Arora and Uri Meir.
  Proceedings of SIAM Symposium on Simplicity in Algorithms (SOSA), 2025.


• Sparse graph counting and Kelley-Meka bounds for binary systems, with Yuval Filmus, Hamed Hatami, and Kaave Hosseini.
  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.
  Proceedings of the 32nd Annual European Symposium on Algorithms (ESA), 2024.


• Property testing with online adversaries, with Omri Ben-Eliezer, Uri Meir, and Sofya Raskhodnikova.
  ACM Transactions on Computation Theory, vol. 18, 2026.
  Preliminary version appeared in the proceedings of the 15th 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 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023.


• Theorems of KKL, Friedgut, and Talagrand via random restrictions and Log-Sobolev 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 Fourier-entropy conjecture?, with Guy Kindler, Noam Lifshitz, Dor Minzer, and Muli Safra.
  Geometric and Functional Analysis, vol. 30, 2020.
  Preliminary version appeared in the proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2020.