• Nikhil Bansal, Aditi Laddha and Santosh Vempala. A Unified Approach to Discrepancy Minimization
  • Chin Ho Lee, Edward Pyne and Salil Vadhan. Fourier growth of regular branching programs
  • David Mass and Tali Kaufman. Double Balanced Sets in High Dimensional Expanders
  • Antonio Blanca, Sarah Cannon and Will Perkins. Fast and perfect sampling of subgraphs and polymer systems
  • Izhar Oppenheim and Tali Kaufman. High dimensional expansion implies amplified local testability
  • Uma Girish, Kunal Mittal, Ran Raz and Wei Zhan. Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs
  • Hermish Mehta and Daniel Reichman. Local treewidth of random and noisy graphs with applications to stopping contagion in networks
  • Ryan Gabrys, Venkatesan Guruswami, João Ribeiro and Ke Wu. Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions
  • Peter Ivanov, Xuangui Huang and Emanuele Viola. Affine extractors and AC0-Parity
  • Zhao Song and Ruizhe Zhang. Hyperbolic Concentration, Anti-concentration, and Discrepancy
  • Dan Karliner and Amnon Ta-Shma. Improved Local testing for multiplicity codes
  • Itay Kalev and Amnon Ta-Shma. Unbalanced Expanders from Multiplicity Codes
  • Yi Li, Honghao Lin, David Woodruff and Yuheng Zhang. Streaming Algorithms with Large Approximation Factors
  • Hridesh Kedia, Shunhao Oh and Dana Randall. Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems
  • Maciej Skorski. Tight Chernoff-Like Bounds under Limited Independence
  • Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett and Ruizhe Zhang. Eigenstripping, Spectral Decay, and Edge-Expansion on Posets
  • Iwan Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin and Hsin-Po Wang. Accelerating Polarization via Field Extension
  • Nathaniel Harms, Louis Esperet and Andrey Kupavskii. Sketching Distances in Monotone Graph Classes
  • Mika Göös and Siddhartha Jain. Communication Complexity of Collision
  • Venkatesan Guruswami, Xin Lyu and Xiuhan Wang. Range Avoidance for Low-depth Circuits and Connections to Pseudorandomness
  • Vishwas Bhargava, Ankit Garg, Chandan Saha and Neeraj Kayal. Learning generalized depth three arithmetic circuits in the non-degenerate case
  • Hamed Hatami, Pooya Hatami, William Pires, Ran Tao and Rosie Zhao. Lower Bound Methods for Sign-rank and their Limitations
  • V. Arvind, Abhranil Chatterjee and Partha Mukhopadhyay. Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time
  • Antonio Blanca and Reza Gheissari. Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics
  • Weiming Feng, Heng Guo and Jiaheng Wang. Improved bounds for randomly colouring simple hypergraphs
  • Yahel Manor and Or Meir. Lifting with Inner Functions of Polynomial Discrepancy
  • Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra and Sayantan Sen. Exploring the Gap between Tolerant and Non-tolerant Distribution Testing
  • Peter Mörters, Christian Sohler and Stefan Walzer. A Sublinear Local Access Implementation for the Chinese Restaurant Process
  • Calum MacRury, Jane Gao and Pawel Pralat. A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process
  • Marcos Kiwi, Markus Schepers and John Sylvester. Cover and Hitting Times of Hyperbolic Random Graphs
  • Sepideh Mahabadi, David P. Woodruff and Samson Zhou. Adaptive Sketches for Robust Regression with Importance Sampling