• Ron Zadicario and Amnon Ta-Shma. The expander hitting property when the sets are arbitrarily unbalanced
  • Xiaoyu Chen, Heng Guo, Xinyuan Zhang and Zongrui Zou. Near-linear time samplers for matroid independent sets with applications
  • Ishaq Aden-Ali, Yanjun Han, Jelani Nelson and Huacheng Yu. On the amortized complexity of approximate counting
  • Ashish Gola, Igor Shinkar and Harsimran Singh. Matrix Multiplication Reductions
  • Ishay Haviv and Michal Parnas. Testing Intersectingness of Uniform Families
  • Lap Chi Lau and Dante Tjowasi. On Houdre-Tetali Conjecture for Isoperimetric Constant of Graphs
  • Hadley Black. Nearly Optimal Bounds for Sample-Based Testing and Learning of $k$-Monotone Functions
  • Nader Bshouty and George Haddad. Approximating the Number of Relevant Variables in a Parity Implies Proper Learning
  • Arnab Chatterjee, Amin Coja-Oghlan, Noela Müller, Connor Riddlesden, Maurice Rolvien, Pavel Zakharov and Haodong Zhu. The number of random 2-SAT solutions is asymptotically log-normal
  • Monika Henzinger, A. R. Sricharan and Teresa Anna Steiner. Private Counting of Distinct Elements in the Turnstile Model and Extensions
  • Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje and Chao Yan. Hilbert Functions and Low-Degree Randomness Extractors
  • Huck Bennett, Karthik Gajulapalli, Alexander Golovnev and Evelyn Warton. Matrix Multiplication Verification Using Coding Theory
  • Eden Fargion, Ran Gelles and Meghal Gupta. Interactive Coding with Unbounded Noise
  • Ashish Dwivedi, Zeyu Guo and Ben Lee Volk. Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
  • Tomer Adar and Eldar Fischer. Refining the Adaptivity Notion in the Huge Object Model
  • Tomer Adar, Eldar Fischer and Amit Levi. Support Testing in the Huge Object Model
  • Evan Chang, Neel Kolhe and Youngtak Sohn. Upper bounds on the $2$-colorability threshold of random $d$-regular $k$-uniform hypergraphs for $k\geq 3$
  • Tomer Adar, Eldar Fischer and Amit Levi. Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries
  • Holden Lee. Parallelising Glauber dynamics
  • Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy and Vladimir Podolskii Podolskii. Towards Simpler Sorting Networks and Monotone Circuits for Majority
  • Halley Goldberg and Valentine Kabanets. Consequences of Randomized Reductions from SAT to Time-Bounded Kolmogorov Complexity
  • Xi Chen, Anindya De, Chin Ho Lee and Rocco Servedio. Trace reconstruction from local statistical queries
  • Dean Doron, Jonathan Mosheiff and Mary Wootters. When Do Low-Rate Concatenated Codes Approach The Gilbert–Varshamov Bound?
  • Amey Bhangale, Mark Braverman, Subhash Khot, Yang Liu and Dor Minzer. Parallel Repetition of k-Player Projection Games
  • Praneeth Kacham and David P. Woodruff. Faster Algorithms for Schatten-p Low Rank Approximation
  • Aiya Kuchukova, Marcus Pappik, Will Perkins and Corrine Yap. Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs
  • Uri Meir, Gregory Schwartzman and Yuichi Yoshida. Stochastic Distance in Property Testing
  • Vedat Levi Alev and Shravas Rao. Expanderizing Higher Order Random Walks
  • Elad Aigner-Horev, Dan Hefetz and Mathias Schacht. Ramsey properties of randomly perturbed hypergraphs
  • Reut Levi, Moti Medina and Omer Tubul. Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs
  • Kuan Cheng, Minghui Ouyang, Chong Shangguan and Yuanting Shen. When can an expander code correct $\Omega(n)$ errors in $O(n)$ time?
  • Yotam Dikstein and Irit Dinur. Coboundary and cosystolic expansion without dependence on dimension or degree
  • Vishesh Jain and Clayton Mizgerd. Rapid mixing of the down-up walk on matchings of a fixed size
  • Nikhil Mande, Manaswi Paraashar, Swagato Sanyal and Nitin Saurabh. On the communication complexity of finding a king in a tournament
  • Venkatesan Guruswami and Hsin-Po Wang. Capacity-Achieving Gray Codes
  • Noam Mazor and Rafael Pass. On Black-Box Meta Complexity and Function Inversion
  • Nicholas Harvey and Arvin Sahami. Explicit and near-optimal construction of t-rankwise independent permutations
  •  Inbar Ben Yaacov, Yotam Dikstein, and Gal Maor. Sparse High Dimensional Expanders via Local Lifts
  • Kuan Cheng and Ruiyang Wu. Randomness Extractors in AC0 and NC1: Optimal up to Constant Factors
  • Andreas Galanis, Alkis Kalavasis and Anthimos-Vardis Kandiros. On Sampling from Ising Models with Spectral Constraints
  • Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar and Nitin Saurabh. Approximate Degree Composition for Recursive Functions
  • Tal Herman. Public Coin Interactive Proofs for Label-Invariant Distribution Properties
  • Jakub Tetek. Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private
  • Kostas Lakis, Johannes Lengler, Kalina Petrova and Leon Schiller. Improved bounds for polylogarithmic graph distances in scale-free percolation and related models
  • Pranjal Dutta, Amit Sinhababu and Thomas Thierauf. Derandomizing Multivariate Polynomial Factoring for Low Degree Factors