William Hoza. Better Pseudodistributions and Derandomization for Space-Bounded Computation
Zvika Brakerski, Noah Stephens-Davidowitz and Vinod Vaikuntanathan. On the Hardness of Average-case k-SUM
Vishwas Bhargava and Sumanta Ghosh. Improved Hitting Set for Orbit of ROABPs
David Harris, Fotis Iliopoulos and Vladimir Kolmogorov. A new notion of commutativity for the algorithmic Lov\'{a}sz Local Lemma
Kuikui Liu. From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk
Sankeerth Rao Karingula and Shachar Lovett. Singularity of random integer matrices with large entries
Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra and Sayantan Sen. Interplay between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds
Yi Li and David P. Woodruff. The Product of Gaussian Matrices is Close to Gaussian
Andreas Galanis, Leslie Ann Goldberg and James Stewart. Fast mixing via polymers for random graphs with unbounded degree
Rocco Servedio and Li-Yang Tan. Deterministic approximate counting of polynomial threshold functions via a derandomized regularity lemma
Louis Golowich. Improved Product-Based High-Dimensional Expanders
Fotis Iliopoulos. Improved bounds for coloring locally sparse hypergraphs
Rikhav Shah and Sandeep Silwal. Smoothed analysis of the condition number under low-rank perturbations
Sumanta Ghosh and Rohit Gurjar. Matroid Intersection: A pseudo-deterministic parallel reduction from search to weighted-decision
Srikanth Srinivasan and S. Venkitesh. On the Probabilistic Degree of an n-variate Boolean Function
Antonio Blanca, Zongchen Chen, Daniel Stefankovic and Eric Vigoda. The Swendsen-Wang Dynamics on Trees
Arijit BishnuArijit Ghosh and Gopinath Mishra. Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube
Guy Blanc, Jane Lange, Mingda Qiao and Li-Yang Tan. Decision tree heuristics can fail, even in the smoothed setting
Ninad Rajgopal and Rahul Santhanam. On the Structure of Learnability beyond P/poly
Antonio Blanca, Alistair Sinclair and Xusheng Zhang. The Critical Mean-field Chayes-Machta Dynamics
Sepehr Assadi and Soheil Behnezhad. On the Robust Communication Complexity of Bipartite Matching
Aditya Parulekar, Advait Parulekar and Eric Price. L1 Regression with Lewis Weights Subsampling
Chandan Saha and Bhargav Thankey. Hitting Sets for Orbits of Circuit Classes and Polynomial Families
Talya Eden, Saleet Mossel and Ronitt Rubinfeld. Sampling Multiple Edges Efficiently
Uma GirishRan Raz and Wei Zhan. Lower Bounds for XOR of Forrelations
Jarosław Błasiok, Peter Ivanov, Yaonan Jin, Chin Ho LeeRocco Servedio and Emanuele Viola. Fourier growth of structured F_2-polynomials and applications
Inbar Ben Yaacov, Gil Cohen and Anand Kumar Narayanan. Candidate Tree Codes via Pascal Determinant Cubes
Amartya Shankha Biswas, Talya Eden and Ronitt Rubinfeld. Decomposition-Optimal Algorithms for Counting and Sampling Arbitrary Subgraphs in Sublinear Time
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar and Madhu Sudan. Ideal-theoretic Explanation of Capacity-achieving Decoding
Omar Alrabiah and Venkatesan Guruswami. Visible Rank and Codes with Locality
Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal and Salil Vadhan. Pseudorandom Generators for Read-Once Monotone Branching Programs
Varsha Dani, Diksha Gupta and Thomas Hayes. The Power of Choice for $k$-Colorability of Random Graphs
Sumegha Garg, Pravesh K Kothari, Pengda Liu and Ran Raz. Memory-Sample Lower Bounds for Learning Parity with Noise
Reut Levi and Nadav Shoshan. Testing Hamiltonicity (and other problems) in Minor-Free Graphs
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz and Wei Zhan. Parallel Repetition for the GHZ Game: A Simpler Proof