I am an Assistant Professor of Computer Science at the University of Central Florida.

I work in theoretical computer science, mostly complexity theory and theoretical cryptography. Problems I am currently thinking about:

• Circuit range avoidance and unconditional circuit lower bounds
• Fine-grained complexity and conditional lower bounds
• Pseudo-deterministic algorithms
• Complexity of optimal compression algorithms
• Data structure lower bounds

Before UCF, I did my PhD at Georgetown, advised by the wonderful Alexander Golovnev. Before that I was an undergraduate at UC Irvine, where I was advised by Vijay Vazirani.

This fall I am teaching Honors Discrete Math (COT 3100C).

Here is a flyer for a talk I gave as an undergrad trying to recruit unsuspecting students into complexity theory.