# Theoretical computer science stuff

I'm currently a fifth-year grad student at UT Austin, where I study theoretical computer science. I have the good fortune to be advised by David Zuckerman. Previously, I was an undergrad at Caltech, where I was lucky to receive valuable mentorship from Leonard Schulman and Chris Umans.

I study "computational complexity theory", which means I use the methods of mathematics to try to understand just how powerful different computational resources are. These "computational resources" include things like time, memory, communication, randomness, quantum mechanics, etc. I'm especially interested in the question of whether randomness is ever necessary for low-memory computation. To work on problems like that, people such as me study "pseudorandomness", which refers to any phenomenon where something looks more random than it actually is.

My research papers are listed below, sorted by the date they were first posted online, from newest to oldest. If you have any questions or comments, send me an email! Like most researchers, I like getting emails about my work.

- Pseudorandom Generators for Unbounded-Width Permutation Branching Programs

With Edward Pyne and Salil Vadhan

Manuscript, 2020 - Hitting Sets Give Two-Sided Derandomization of Small Space

With Kuan Cheng

In CCC 2020 - Log-Seed Pseudorandom Generators via Iterated Restrictions

With Dean Doron and Pooya Hatami

In CCC 2020 - Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas

With Dean Doron and Pooya Hatami

In CCC 2019 - Simple Optimal Hitting Sets for Small-Success RL

With David Zuckerman

In SICOMP, 2020 (preliminary version in FOCS 2018) - Typically-Correct Derandomization for Small Time and Space

In CCC 2019 - Quantum Communication-Query Tradeoffs

Manuscript, 2017 - Universal Bell Correlations Do Not Exist

With Cole A. Graham

In PRL, 2017 - Preserving Randomness for Adaptive Algorithms

With Adam R. Klivans

In RANDOM 2018 - Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace

With Chris Umans

In STOC 2017 - The Adversarial Noise Threshold for Distributed Protocols

With Leonard Schulman

In SODA 2016