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

–
Coffee and Check-In
–
Opening Remarks
–
Explicit Constructions of Two-Source Extractors and Ramsey Graphs
Eshan Chattopadhyay, Institute for Advanced Study
–
Correlation Breakers, Independence-Preserving Mergers, and their Applications
Gil Cohen, Princeton University
–
Break
–
An Efficient Reduction from Non-Malleable Extractors to Two-Source Extractors, and Explicit Two-Source Extractors with Near-Logarithmic Min-Entropy
Amnon Ta-Shma, Tel Aviv University
–
Lunch
–
Extractors for Algebraic Sources
Zeev Dvir, Princeton University
–
Ramanujan Covers
Will Sawin, , ETH Zurich
–
Break
–
Two Existence Proofs of Ramanujan Graphs
Adam Marcus, Princeton University
–
Reception
–
Coffee and Check-In
–
Some of My Favorite Open Problems on Expanders and Extractors
Avi Wigderson, Institute for Advanced Study
–
High Dimensional Expanders and PCPs
Irit Dinur, Weizmann Institute
–
Break
–
Discrete Log Problem with Respect to the LPS generators on PGL_2
Naser Talebizadeh Sardari, Princeton University
–
Lunch
–
Golden Gates, Ramanujan Complexes and Ramanujan Digraphs
Ori Parzanchevski, Hebrew University of Jerusalem
–
Super-Approximation
Alireza Salehi Golsefidy, UC San Diego
–
Break
–
Markoff Triples and Strong Approximation
Alex Gamburd, City University of New York
–
Coffee and Check-In
–
High Dimensional Expanders
Alex Lubotzky, Hebrew University of Jerusalem
–
Bounded Degree High Dimensional Expanders and Topological Overlapping
Tali Kaufman, Bar-Ilan University
–
Break
–
Random Walks on Ramanujan Graphs, Digraphs and Complexes
Eyal Lubetzky, Courant Institute
–
Lunch
–
Free Afternoon
–
Break
–
Open Problems Session
–
Coffee and Check-In
–
A Generalized Alon-Boppana Bound and Weak Ramanujan Graphs
Fan Chung, UC San Diego
–
Word-Measures on Unitary Groups
Doron Puder, Tel Aviv University
–
Break
–
What are High-Dimensional Expanders?
Nati Linial, Hebrew University of Jerusalem
–
Lunch
–
(Yet More) List-Decodability of Random Linear Codes
Mary Wootters, Stanford University
–
Expander-Based Constructions of Locally Testable and Locally Decodable Codes
Noga, Ron-Zewi, Ben, Gurion, University
–
Break
–
Pseudorandomness When the Odds Are Against You
Ronen Shaltiel, University of Haifa
–
Coffee and Check-In
–
Finding and Using Expanders in Locally Sparse Graphs and in Sparse Random Graphs
Michael Krivelevich, Tel Aviv University
–
Spectral Gaps and Geometric Representations
Amir Yehudayoff, Technion Israel Institute of Technology
–
Break
–
Improved Deterministic Randomness Extraction from Non-Binary Santha-Vazirani Sources
Siyao Guo, New York University
–
Lunch
–
The Diameter of the Symmetric Group: Ideas and Tools
Harald, Helfgott, University of Göttingen