I'm a first-year PhD student in the Theory Group advised by Roei Tell. I'm interested broadly in computational complexity theory, but more specifically currently focusing on circuit complexity, derandomization, and metacomplexity. Before my PhD, I was an undergraduate student at the University of Massachusetts Amherst from 2020-2023, and I graduated in December of 2023 with a B.S. in Computer Science and Mathematics. In 2022, during my undergrad, I was part of the DIMACS REU: you can read about my experience here. I enjoy teaching and have been a course assistant of some kind consistently since my junior year of undergrad, helping teach primarily theory-focused courses.
Non-academically, some of the things I'm interested in are video games, literature (especially poetry), and bass guitar.
At a high level, computational complexity is a field that studies abstract models of computation and sees what kinds of resources those models require in order to solve problems. I'm interested in many different areas of this field, but I'm particularly interested in a model of computation called boolean circuits, which are an abstract generalization of real-world circuits. Circuit complexity is a huge area of research, and I'm currently focused on questions revolving around how this model relates to the Turing Machine model. It's currently unknown if or how much stronger this circuit model is compared to the Turing Machine model, and depending on the result, an answer to this could resolve many big open questions, such as whether randomness is a fundamentally strong computational resource or not.
If you are curious about the field, feel free to send me an email! The field is huge and I can only talk about the parts I know, but it's incredibly fascinating and surprising.
This site is still a work-in-progress...