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

• Online versus Offline Adversaries in Property Testing, with Ephraim Linder, and Sofya Raskhodnikova.
  To appear in the proceedings of the 15th Innovations in Theoretical Computer Science Conference (ITCS), 2025.


• On Optimal Testing of Linearity, with Vipul Arora, and Uri Meir.
  To appear in the 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 European Symposium on Algorithms (ESA), 2024.


• 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.


• 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.
  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.