Schedule

The primary conference location will be the Simmons Auditorium, Tepper School of Business, 5000 Forbes Ave, Carnegie Mellon University. The conference will be run as a single session.

Saturday, October 11

9:30-10:00 Rose McCarty

10:00-10:30 Ahmad Abdi

10:30-11:00 Coffee break

11:00-11:30 Gabor Pataki

11:30-12:00 Mohit Singh

12:00-2:00 Lunch

2:00-2:30 Gerard Cornuejols

2:30-3:00 Michael Krivelevich

3:00-3:30 Coffee break

3:30-4:00 Mike Molloy

4:00-4:30 Eric Vigoda

4:40-5:10 Wesley Pegden 

6:30-9:00 Dinner celebration for Alan Frieze (invitation only)

Poster Presenters for Friday's Poster Session

Aditya Lonkar (Georgia Tech): Counting and Sampling random k-SAT near the satisfiability threshold

Emile Anand (Georgia Tech): Structural Complexity of Matrix-Vector Multiplication

Siyue Liu (CMU): Constructing Integral Basis of the Lattice of Dijoins in Strongly Polynomial Time

Kyra Gunluk (Georgia Tech): Deterministically Approximating the Volume of a Hypercube clipped by Hyperplanes

Zejia Chen (Georgia Tech): Rapid Mixing on Random Regular Graphs beyond Uniqueness

Kiriaki Fragkia (CMU): Learning in Structured Stackelberg Games

Theodore Morrison (Waterloo): Satisfiability thresholds of random linear equations over a finite commutative ring

Lingqing Shen (CMU): Improved Relaxation with Efficient Algorithm for the Maximum-Entropy Sampling Problem

Thinula De Silva (Waterloo):  Non-uniform Kahn-Kalai: the fractional version, the dual and its power in capturing “thresholds"

Daniel Zhang (Georgia Tech): Sampling Sphere Packings with Continuum Glauber

Kavya Ravichandran (TTIC):  Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem

Hao Hao (CMU): Robust Paths: Geometry and Computation

Tolson Bell (CMU): Rainbow Thresholds