Workshops

Spring 2017

Pseudorandomness Reunion

Jun. 18 – Jun. 21, 2018

Return to event »

Click on the titles of individual talks for abstract.

Monday, June 18th, 2018
9:00 am – 9:20 am		Coffee and Check-In
9:20 am – 9:30 am		Welcome Remarks
9:30 am – 10:15 am		Boosting and Regularity Russell Impagliazzo, UC San Diego
10:15 am – 10:45 am		A Fast New Algorithm for Weak Graph Regularity László Miklós Lovász , UCLA
10:45 am – 11:15 am		Break
11:15 am – 12:00 pm		Simple Optimal Hitting Sets for Small-Success RL David Zuckerman, University of Texas at Austin
12:00 pm – 2:00 pm		Lunch
2:00 pm – 2:45 pm		A Stable Arithmetic Regularity Lemma in Finite Abelian Groups Caroline Terry, University of Maryland
2:45 pm – 3:15 pm		Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity Manuel Sabin, UC Berkeley
3:15 pm – 3:45 pm		Break
3:45 pm – 4:15 pm		Improved Extractors for Recognizable and Algebraic Sources Fu Li, University of Texas at Austin
4:15 pm – 5:00 pm		Clustering and Dispersion of Points in the Line and the Plane Fan Chung, UC San Diego
5:00 pm – 6:00 pm		Reception

Tuesday, June 19th, 2018
9:00 am – 9:30 am		Coffee and Check-In
9:30 am – 10:15 am		Pseudorandom Generators from Polarizing Random Walks Kaave Hosseini, UC San Diego
10:15 am – 10:45 am		Efficient Arithmetic Regularity and Removal Lemmas for Induced Bipartite Patterns Yufei Zhao, Massachusetts Institute of Technology
10:45 am – 11:15 am		Break
11:15 am – 12:00 pm		Small-Box Cryptography, and the Provable Security of SPNs Yevgeniy Dodis, New York University
12:00 pm – 2:00 pm		Lunch
2:00 pm – 2:45 pm		A Lower Bound for the k-colored Sum-free Problem in Z_m^n Lisa Sauermann, Stanford University
2:45 pm – 3:15 pm		Pseudorandom Generators from Gaussian Processes Anindya De, Northwestern University
3:15 pm – 3:45 pm		Break
3:45 pm – 4:30 pm		Problem Session

Wednesday, June 20th, 2018
9:00 am – 9:30 am		Coffee and Check-In
9:30 am – 10:15 am		Hypergraph Expanders from Cayley Graphs David Conlon, University of Oxford
10:15 am – 10:45 am		A Notion of VC-dimension for Subsets of Groups – Analysis, Combinatorics and Structure Olof Sisask, KTH Royal Institute of Technology
10:45 am – 11:15 am		Break
11:15 am – 12:00 pm		Near-Optimal Erasure List-Decodable Codes Dean Doron, Tel Aviv University
12:00 pm – 2:00 pm		Lunch
2:00 pm – 2:45 pm		Ramsey Results over Sparse Arithmetic Sets Sean Prendiville, University of Manchester
2:45 pm – 3:15 pm		Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions Xin Li, Johns Hopkins University
3:15 pm – 3:45 pm		Break
3:45 pm – 4:15 pm		Non-Malleable Codes for Small-Depth Circuits Siyao Guo, New York University
4:15 pm – 5:00 pm		Quo vadis?

Thursday, June 21st, 2018
9:00 am – 9:30 am		Coffee and Check-In
9:30 am – 10:15 am		Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity Eshan Chattopadhyay, Institute for Advanced Study
10:15 am – 10:45 am		Existence of Simple Extractors Xue Chen, University of Texas at Austin
10:45 am – 11:15 am		Break
11:15 am – 12:00 pm		A Solution to the Burr-Erdos Problems on Ramsey Completeness Jacob Fox, Stanford University