Dean Doron and William Hoza. Implications of Better PRGs for Permutation Branching Programs

Igor Shinkar and Harsimran Singh. A Simplified Reduction for Error Correcting Matrix Multiplication Algorithms

Zhangsong Li. Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs

Lorenzo Beretta. New Statistical and Computational Results for Learning Junta Distributions

Simon Apers, Frédéric Magniez, Sayantan Sen and Daniel Szabó. Quantum property testing in sparse directed graphs

Dean Doron and Ori Fridman. Bit-Fixing Extractors for Almost-Logarithmic Entropy

Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan and Madhu Sudan. Eigenvalue Bounds for Symmetric Markov Chains on Multislices With Applications

William Hoza and Zelin Lv. Fooling Near-Maximal Decision Trees

Ben Chen and Amnon Ta-Shma. Simplifying Armoni’s PRG

Fatemeh Ghasemi, Gal Gross and Swastik Kopparty. Permanental Rank vs. Determinantal Rank of Random Matrices Over Finite Fields

Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff and João Ribeiro. Low-Degree Polynomials Are Good Extractors

Dar Gilboa, Siddhartha Jain and Jarrod McClean. Consumable Data via Quantum Communication

Alessandro Epasto, Quanquan Liu, Tamalika Mukherjee and Felix Zhou. Sublinear Space Graph Algorithms in the Continual Release Model

Dariusz Kowalski, Piotr Krysta and Shay Kutten. What is the minimum number of random bits required for computability and efficiency in anonymous networks?

Yumou Fei and Renato Ferreira Pinto Jr. On the Spectral Expansion of Monotone Subsets of the Hypercube

Zeyu Guo, Chaoping Xing, Chen Yuan and Zihan Zhang. Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio

Venkatesan Guruswami and Shilun Li. Density Frankl–Rödl on the Sphere

Clément Canonne, Yun Li and Seeun William Umboh. Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them

Xiaoyu Chen, Hongyang Liu, Yitong Yin and Xinyuan Zhang. Efficient Parallel Ising Samplers via Localization Schemes

Zongchen Chen, Dan Mikulincer, Daniel Reichman and Alexander Wein. Time Lower Bounds for the Metropolis Process and Simulated Annealing

Eren C. Kizildag. Sharp Thresholds for the Overlap Gap Property: Ising $p$-Spin Glass and Random $k$-SAT

Fernando Granha Jeronimo, Tushant Mittal and Sourya Roy. Pseudorandomness of Expander Walks via Fourier Analysis on Groups

Adar Hadad and Moni Naor. Shared Randomness in Locally Checkable Problems: The Role of Computational Assumptions

Zongchen Chen and Tianhui Jiang. Improved Mixing of Critical Hardcore Model

Simina Branzei, Reed Phillips and Nicholas Recker. Tarski Lower Bounds from Multi-Dimensional Herringbones

Nikhil Shagrithaya and Ray Li. Near-Optimal List-Recovery of Linear Code Families

Surendra Ghentiyala and Venkatesan Guruswami. New constructions of pseudorandom codes

Farzan Byramji and Russell Impagliazzo. Lifting to Randomized Parity Decision Trees

Ramya C, Partha Mukhopadhyay and Pratik Shastri. Efficient Polynomial Identity Testing Over Nonassociative Algebras

Dean Doron, Jonathan Mosheiff, Nicolas Resch and João Ribeiro. List-Recovery of Random Linear Codes over Small Fields

Mika Goos, Nathaniel Harms and Artur Riazanov. Equality is Far Weaker than Constant-Cost Communication

Sumegha Garg, Madhu Sudan and Gabriel Wu. Testing Tensor Products of Algebraic Codes

Konrad Anand, Graham Freifeld, Heng Guo, Chunyang Wang and Jiaheng Wang. Sink-free orientations: a local sampler with applications

Cassandra Marcussen, Edward Pyne, Ronitt Rubinfeld, Asaf Shapira and Shlomo Tauber. A Fast Coloring Oracle for Average Case Hypergraphs

Neha Kuntewar and Jayalal Sarma. Avoiding Range via Turan-type Bounds

Benny Applebaum, Dung Bui, Geoffroy Couteau and Nikolas Melissaris. Structured-Seed Local Pseudorandom Generators and their Applications

Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov and Weiqiang Yuan. Searching for Falsified Clause in Random $(\log{n})$-CNFs is Hard for Randomized Communication

Alina Ene, Huy Nguyen, Ta Duy Nguyen and Adrian Vladu. Solving Linear Programs with Differential Privacy

Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar and Manmatha Roy. Testing Isomorphism of Boolean Functions over Finite Abelian Groups

William Hoza and Zelin Lv. On Sums of INW Pseudorandom Generators

Xiaoyu Chen and Weiming Feng. Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree