Explicit Almost-Optimal ε-Balanced Codes via Free Expander Walks @SimonsInstitute
Explicit Almost-Optimal ε-Balanced Codes via Free Expander Walks  @SimonsInstitute
Uploaded October 2026 | Updated November 2026, 4 days ago
Tim Hsieh (Massachusetts Institute of Technology)
https://simons.berkeley.edu/talks/tim-hsieh-massachusetts-institute-technology-2026-09-30
Explicit Constructions
Explicit Almost-Optimal ε-Balanced Codes via Free Expander WalksKikuchi Graphs: A Spectral Method for HypergraphsA survey on PIT for read-once algebraic branching programsNew directions in catalytic derandomizationPolar Codes IFourier quasicrystals from stable polynomials and beyondAlgebraic Geometry and Discrete Periodic OperatorsFinite free information inequalitiesToward Provably Private Federated LearningCompressed timestamps and efficient random walks in catalytic spaceRandom unitary circuits with constant spectral gapFrom local discrete curvature notions of graphs to global properties of the underlying spaces
Simons Institute for the Theory of Computing |

Explicit Almost-Optimal ε-Balanced Codes via Free Expander Walks

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER