• Click on the titles of individual talks for abstract, slides and archived video (if applicable).

–
Coffee and Check-In
–
Opening Remarks
–
The Uncanny Usefulness of Constructive Proofs of Pseudorandomness
Valentine Kabanets, Simon Fraser University
–
Approximately Counting Solutions to Systems of Quadratic Equations
Ryan Williams, MIT
–
Break
–
Pseudorandomness in Data Structures
Omer Reingold, Stanford University
–
Lunch
–
Packing Degenerate Graphs Using Pseudorandomness
Julia Böttcher, London School of Economics
–
Regularity Inheritance in Pseudorandom Graphs
Maya Stein, University of Chile
–
Break
–
The Number of B_h-sets of a Given Cardinality
Yoshiharu Kohayakawa, University of, S, ã, o, Paulo
–
Reception
–
Coffee and Check-In
–
Removal Lemmas with Polynomial Bounds
Asaf Shapira, Tel-Aviv University
–
Break
–
Forcing Quasirandomness with Triangles
Mathias Schacht, University of Hamburg
–
Lunch
–
Explicit, Almost Optimal, Epsilon-Balanced Codes
Amnon Ta-Shma, Tel Aviv University
–
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform
Piotr Indyk, MIT
–
Break
–
Open Problem Session
–
Coffee and Check-In
–
Preserving Randomness for Adaptive Adversaries
Adam Klivans, University of Texas, Austin
–
Break
–
Mixing Implies Lower Bounds for Space Bounded Learning
Dana Moshkovitz, University of Texas, Austin
–
Lunch
–
Free Afternoon
–
Algorithmic Regularity Lemmas and Applications
László Miklós Lovász, MIT
–
Linear-Algebraic Pseudorandomness: Subspace Designs and Dimension Expanders
Venkatesan Guruswami, Carnegie Mellon University
–
Coffee and Check-In
–
Derandomizing "Algebraic RL"
Michael Forbes, Princeton University
–
Break
–
Deterministic Isolation for Bipartite Matching and Matroid Intersection
Rohit Gurjar, Tel Aviv University
–
PRGs for Small Space via Fourier Analysis
Thomas Steinke, IBM Almaden
–
Lunch
–
Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time
Li-Yang Tan, TTI Chicago
–
Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas
Rocco Servedio, Columbia University
–
Break
–
Query-to-Communication Lifting for BPP
Mika Göös, University of Toronto
–
Coffee and Check-In
–
Fast Permutation Property Testing and Metrics of Permutations
Fan Wei, Stanford University
–
Break
–
Randomness Intuition
Jacob Fox, Stanford University
–
Lunch
–
A Reduction from Efficient Non-Malleable Extractors to Low-Error Two-Source Extractors
Dean Doron, Tel Aviv University