Talks
On this page, you can find slides and/or videos for various talks I've given at conferences, workshops, seminars, etc.
- "OpenAI's Proof That L = BPL." Simons Institute, October 2026. [Part 1 video] [Part 1 slides pptx] [Part 1 slides pdf] [Part 2 video] [Part 2 slides pptx] [Part 2 slides pdf]
- "Derandomizing Space-Bounded Computation." Simons Institute, September 2026. [Part 1 video] [Part 1 slides pptx] [Part 1 slides pdf] [Part 2 video] [Part 2 slides pptx] [Part 2 slides pdf]
- "Fooling Near-Maximal Decision Trees." UChicago CS Theory Lunch, January 2025. [Slides pptx] [Slides pdf]
- "A Technique for Hardness Amplification Against AC^0." Dagstuhl Seminar 24381, September 2024. [Slides pptx]
- "A Technique for Hardness Amplification Against AC^0." UChicago CS Theory Lunch, January 2024. [Slides pptx]
- "Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting." IAS Computer Science and Discrete Mathematics Seminar, November 2023. [Video]
- "Recent Progress on Derandomizing Space-Bounded Computation." IAS Computer Science and Discrete Mathematics Seminar, November 2023. [Video] [Slides pptx]
- "Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees." STOC, June 2023. [Slides pptx]
- "Hitting Sets Give Two-Sided Derandomization of Small Space." UIUC CS Theory Seminar, November 2022. [Slides pptx]
- "Recent Progress on Derandomizing Space-Bounded Computation." University of Warwick Complexity Meetings, November 2022. [Slides pptx]
- "Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees." Dagstuhl Seminar 22371, September 2022. [Slides pdf]
- "Hitting Sets for Regular Branching Programs." CCC, July 2022. [Video] [Slides pptx]
- "Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees." TOCA-SV, May 2022. [Slides pdf]
- "Fooling Constant-Depth Threshold Circuits." UT Austin Theory Seminar, April 2022. [Slides pptx]
- "Better Pseudodistributions and Derandomization for Space-Bounded Computation." RANDOM, August 2021. [Prerecorded video] [Prerecorded slides pptx] [Live video] [Live slides pptx]
- "Better Pseudodistributions and Derandomization for Space-Bounded Computation." Oxford-Warwick Complexity Meetings, July 2021. [Slides pptx]
- "Fooling Constant-Depth Threshold Circuits." TCS+ Seminar, February 2021. [Video] [Slides pptx]
- "Pseudorandom Generators for Unbounded-Width Permutation Branching Programs." ITCS, January 2021. [Video] [Slides pptx]
- "Hitting Sets Give Two-Sided Derandomization of Small Space." CCC, July 2020. [Video] [Slides pptx]
- "Log-Seed Pseudorandom Generators via Iterated Restrictions." CCC, July 2020. [Video] [Slides pptx]
- "Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas." CCC, July 2019. [Slides pdf]
- "Typically-Correct Derandomization for Small Time and Space." CCC, July 2019. [Video] [Slides pdf]
- "Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas." BIRS workshop 19w5088, July 2019. [Video] [Slides pdf]
- "Simple Optimal Hitting Sets for Small-Success RL." FOCS, October 2018. [Slides pdf]
- "Simple Optimal Hitting Sets for Small-Success RL." Dagstuhl Seminar 18391, September 2018. [Slides pdf]
- "Preserving Randomness for Adaptive Algorithms." RANDOM, August 2018. [Slides pdf]
- "Typically-Correct Derandomization for Small Time and Space." HUJI Theory of Computer Science Seminar, March 2018. [Slides pdf]
- "Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace." STOC, June 2017. [Slides pdf]
- "Preserving Randomness for Adaptive Algorithms." Caltech CS Theory Seminar, May 2017. [Slides pdf]
- "Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace." Dagstuhl Seminar 16411, October 2016. [Slides pdf]
- "The Adversarial Noise Threshold for Distributed Protocols." SODA, January 2016. [Slides pdf]