Program

Monday September 17, 2018

TIME ACTIVITIES VENUE
08:30-09:00 Registration Lobby of Lecture Hall, FIT Building
09:00-09:10 Opening Remarks Lecture Hall, FIT Building
09:10-09:55 Chair:
Ran Duan
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
Josh Alman (MIT)
Lecture Hall, FIT Building
09:55-10:40 Parameterized Inapproximability
Pasin Manurangsi (UC Berkeley)
10:40-10:55 Coffee Break Lobby of Lecture Hall, FIT Building
10:55-11:55 Keynote Talk 1
Chair:
Xiongfeng Ma
Approximation on Scheduling under Precedence Constraints
Shi Li (University at Buffalo)
Lecture Hall, FIT Building
12:00-13:30 Lunch Break
13:30-14:15 Chair:
Ran Duan
An Almost-linear Time Algorithm for Uniform Random Spanning Tree Generation
Aaron Schild (UC Berkeley)
Lecture Hall, FIT Building
14:15-15:00 Dynamic Ordered Sets with Approximate Queries
Or Zamir (Tel Aviv University)
15:00-15:20 Coffee Break Lobby of Lecture Hall, FIT Building
15:20-16:05 Chair:
Zhaohui Wei
Non-Malleable Codes for Small-Depth Circuits
Marshall Ball (Columbia University)
Lecture Hall, FIT Building
16:05-16:50 Secret Sharing and CDS
Tianren Liu (MIT)

 

Tuesday September 18, 2018

TIME ACTIVITIES VENUE
09:00-09:45 Chair:
Xiaoming Sun
Simple Optimal Hitting Sets for Small-Success RL
William Hoza (UT Austin)
Lecture Hall, FIT Building
09:45-10:30 Tight Hardness for Shortest Cycles and Paths in Sparse Graphs
Andrea Lincoln (MIT)
10:30-10:45 Coffee Break Photo at the lobby of FIT Building
10:45-11:45 Keynote Talk 2
Chair:
Ran Duan
Complexity Theory of the LOCAL Model
Seth Pettie (University of Michigan)
Lecture Hall, FIT Building
12:00-13:30 Lunch
13:30-14:15 Chair:
Jian Li
How to Match when All Vertices Arrive Online
Yuhao Zhang (University of Hong Kong)
Lecture Hall, FIT Building
14:15-15:00 Optimal Streaming and Tracking Distinct Elements with High Probability
Jarosław Błasiok (Harvard University)
15:00-15:20 Coffee Break Lobby of Lecture Hall, FIT Building
15:20-16:05 Chair:
Mingji Xia
Beyond Kasteleyn: A New Polynomial-time Algorithm for Six-Vertex Models and a Complexity Trichotomy
Shuai Shao (University of Wisconsin-Madison)
Lecture Hall, FIT Building
16:05-16:50 Torpid Mixing of Markov Chains for the Six-vertex Model on Z^2
Tianyu Liu (University of Wisconsin-Madison)

 

Wednesday September 19, 2018

TIME ACTIVITIES VENUE
09:00-09:45 Chair:
Wei Chen
A General Theory of Sample Complexity for Multi-Item Profit Maximization
Ellen Vitercik (CMU)
Lecture Hall, FIT Building
09:45-10:30 Provably Efficient Algorithms for Learning Simple Convolutional Neural Networks
Surbhi Goel (UT Austin)
10:30-10:55 Group Photo + Coffee Break Photo at the west door of FIT Building
10:55-11:55 Keynote Talk 3
Chair:
Seth Pettie
Yes, There is an Oblivious RAM Lower Bound!
Kasper Green Larsen (Aarhus University)
Lecture Hall, FIT Building
12:00-13:30 Lunch
13:30-14:15 Chair:
Longbo Huang
Selling Partially-Ordered Items: Exploring the Space between Homogeneous and Heterogeneous Mechanism Design
Ariel Schvartzman (Princeton University)
Lecture Hall, FIT Building
14:15-15:00 Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model
Yinan Li (Centrum Wiskunde & Informatica)
15:00-15:20 Coffee Break Lobby of Lecture Hall, FIT Building
15:20-16:05 Chair:
Chenye Wu
Prediction with a Short Memory
Vatsal Sharan (Stanford University)
Lecture Hall, FIT Building
16:05-16:50 Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization
Travis Dick (CMU)
18:00-20:00 Banquet Banquet Hall, Quanjude Restaurant

Thursday September 20, 2018

TIME ACTIVITIES VENUE
09:00-09:45 Chair:
Chenye Wu
A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization
Zhize Li (Tsinghua University)
Lecture Hall, FIT Building
09:45-10:30 Counting Hypergraph Colorings in the Local Lemma Regime
Chao Liao (Shanghai Jiao Tong University)
10:30-10:45 Coffee Break Lobby of Lecture Hall, FIT Building
10:45-11:45 Keynote Talk 4
Chair:
Ran Duan
The Lovász number and beyond: when graph meets quantum
Runyao Duan (Baidu INC)
Lecture Hall, FIT Building
12:00-13:30 Lunch
13:30-14:15 Chair:
Ran Duan
PPP-Completeness with Connections to Cryptography
Manolis Zampetakis (MIT)
Lecture Hall, FIT Building
14:15-15:00 Polar Codes for Compressing Hidden Markov Sources
Preetum Nakkiran (Harvard University)
15:00-15:20 Coffee Break Lobby of Lecture Hall, FIT Building
15:20-16:05 Chair:
Xiongfeng Ma
Matrix Product States for Quantum Stochastic Modeling
Chengran Yang (Nanyang Technological Unversity)
Lecture Hall, FIT Building
16:05-16:50 Quantifying the Coherence of Operations
Thomas Theurer (Ulm University)
16:50-17:00 Closing Ceremony