Research Interests

I have a very broad interest in computational complexity theory. I am interested in all things algebraic, and try to look at things around me from an algebraic perspective. I also like to see the interplay of different techniques, and in particular how unusual techniques can help solve the problem at hand . Below is a very broad list of the areas I am excited about. These aren't necessarily areas I am currently working on, but there are problems in these areas that I find interesting and would like to work on some day.

  1. Algebraic Hardness vs Randomness
  2. Expansion: Groups, High Dimensional expanders, etc 1.
  3. Complexity Theoretic work in Algorithmic Fairness and Learning Theory 1
  4. Additive Combinatorics: Plenty of work surrounding Szemeredi's Theorem
In the past, I have worked on algebraic complexity theory and some problems in tensors.

1. If you are in the greater Boston area and interested in these topics, feel free to reach out. I want to set up a small-ish reading group where we can read, present and explain concepts to each other.