Low-soundness direct product testers and PCPs from Kaufman-Oppenheim complexes; The relative Dehn method for coboundary expansion; A classical quadratic speedup for planted k XOR; Streaming complexity of CSPs with randomly ordered constraints.
Research Experience
Teaching assistant at CMU for: 15-459: Undergraduate Quantum Computation (Fall 2023), 15-754: Spectral Graph Theory (Fall 2025). Teaching assistant at Harvard for: CS 121: Introduction to Theoretical Computer Science (Fall 2019, 2020, 2021), CS 124: Data Structures and Algorithms (Spring 2021), CS 161: Operating Systems (Spring 2020). Organized guest lectures in the 'CS 121.5' advanced section for CS 121 (Fall 2019 and 2020). Teaching assistant for the 2022 New Horizons in TCS program at TTIC in Summer 2022.
Education
Graduated magna cum laude from Harvard with an A.B. in Computer Science and Math in Spring 2022. Worked with Madhu Sudan at Harvard.
Background
Fourth-year Ph.D. student in the Computer Science Department at Carnegie Mellon University, working on theoretical computer science. Advised by Ryan O'Donnell and Aayush Jain, and supported by an NSF GRFP fellowship.
Miscellany
Hobbies include reading, playing piano, listening to music and podcasts, watching TV and movies, baking and cooking, playing tennis, going on long walks, and watching hockey (go Caps!), basketball, and (American) football. Before college, helped found an online high school cybersecurity competition called ångstromCTF (running since 2016!) and redesigned the school newspaper website SilverChips Online.