The Pseudorandomness Toolkit (Part 3) @SimonsInstitute
The Pseudorandomness Toolkit (Part 3)  @SimonsInstitute
Uploaded August 2026 | Updated November 2026, 1 day ago
Dean Doron (Ben-Gurion University)
https://simons.berkeley.edu/talks/dean-doron-ben-gurion-university-2026-08-27
ICM 2026 Satellite Conference: Spectral Theory, High-Dimensional Expansion, and Pseudorandomness

We will explore the pseudorandomness toolkit: the basic objects and techniques used to construct pseudorandom generators and prove various other derandomization results. Topics will include bounded independence, small-bias spaces, randomness extractors, expander graphs, and random restrictions. We will present some of the key constructions and their applications, and see how these ingredients fit together in the main challenges in pseudorandomness. Time permitting, we will also give some ideas being more advanced results, and discuss some open problems.
The Pseudorandomness Toolkit (Part 3)On constant T-depth circuitsSigned Rectified Flow: Negativity-Controlled GenerationDerandomizing Space-Bounded Computation (Part 2)Resonances on geometrically finite graphs and buildingsInference-Time Algorithms: A Theoretical Lens on Tractability and Error PropagationAligning Evaluation Incentives to Reduce HallucinationATHENA: Steering Generative Models toward Better Visual ReasoningReliable Language GenerationStrong Convergence (Part I)Expanding GroupsLinear hashing and friends
Simons Institute for the Theory of Computing |

The Pseudorandomness Toolkit (Part 3)

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER