Abstracts

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