All talks listed in Pacific Time. Schedule subject to change.

–
Coffee and Check In
–
Opening Remarks
–
Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes

Irit Dinur (Weizmann Institute)
Video
–
Break
–
Strongly explicit sorting on HDXs

Noah Singer (Carnegie Mellon University)
Video
–
Lunch (on your own)
–
Condensers/extractors for block sources survey

Mohit Gurumukhani (Cornell University)
Video
–
Break
–
Extractors for Samplable Distributions from the Two-Source Extractor Recipe

Justin Oh (University of Haifa)
Video
–
Break
–
Low error two-source extractors (in person only)

Jesse Goodman (UT Austin)
–
Coffee and Check In
–
Explicit lossless vertex expanders

Rachel Zhang (UC Berkeley)
Video
–
Break
–
Algorithmic List Decoding of Reed–Solomon Codes up to Capacity

Kai Zhe Zheng (IAS)
Video
–
Lunch (on your own)
–
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds

Yeyuan Chen (University of Michigan, Ann Arbor)
Video
–
RMK Lecture Reception
–
My Favorite Expanders | Richard M. Karp Distinguished Lecture
Video
–
Coffee and Check In
–
Sparser Abelian High Dimensional Expanders

Siqi Liu (Duke University)
Video
–
Break
–
A Simple Sub-Polynomial Degree Coboundary Expander

Max Hopkins (Institute for Advanced Study)
Video
–
Lunch (on your own)
–
Explicit free expanders

Sidhanth Mohanty (Northwestern University)
Video
–
Break
–
Explicit Almost-Optimal ε-Balanced Codes via Free Expander Walks

Tim Hsieh (Massachusetts Institute of Technology)
Video
–
Break
–
From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids

Josh Brakensiek (UC Berkeley)
Video
–
Coffee and Check In
–
Algebraic Expander Codes

Itzhak Tamo (Tel-Aviv University)
Video
–
Break
–
Asymptotically good large-alphabet LDCs with polylogarithmic query complexity

Tal Yankovitz (UT Austin)
Video
–
Lunch (on your own)
–
Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes

Elena Grigorescu (University of Waterloo)
Video
–
Break
–
Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes

Geoffrey Mon (UT Austin)
Video
–
Break
–
KMS complexes and their (higher) expansion properties

Inga Valentiner-Branth (Ghent University)
Video
–
Coffee and Check In
–
Fault-Tolerant Quantum Computation with Adversarial Errors

Louis Golowich (UC Berkeley)
Video
–
Break
–
Symmetric Self-Dual Quantum Codes on High Dimensional Expanders with Single-Orbit Low-Weight Checks

Kyle Gulshen (Caltech)
Video
–
Lunch (on your own)
–
Space-efficient list decoding

Noga Ron-Zewi (University of Haifa)
–
Break
–
Binary code rate bounds via classical--quantum channels

Omar Alrabiah (University of California, Berkeley)
Video
–
Break
–
The Quest for Explicit Constructions in Coding Theory

Fernando Granha Jeronimo (University of Illinois Urbana-Champaign)
Video