Postdoctoral fellow at CS and CDS at Boston University and CSAIL, MIT.

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.

• 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

• Property testing with online adversaries, with Omri Ben-Eliezer, Uri Meir, and Sofya Raskhodnikova.
  Proceedings of the 14th Innovations in Theoretical Computer Science Conference (ITCS), 2024.
  Arxiv version
• A Generalization of the Kelley-Meka Theorem to Binary Systems of Linear Forms, with Yuval Filmus, Hamed Hatami, and Kaave Hosseini.
  Arxiv version
• Low Degree Testing over the Reals, with Vipul Arora, Arnab Bhattacharyya, Noah Fleming, and Yuichi Yoshida.
  Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023.
  Arxiv version
• 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.
  ECCC version
• Towards a Proof of the Fourier-Entropy Conjecture?, with Guy Kindler, Noam Lifshitz, Dor Minzer, and Muli Safra.
  GAFA Geometric And Functional Analysis vol. 30, 2020.
  Preliminary version appeared in Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2020.
  Arxiv version