Yumou Fei. Unbounded-width CSPs are Untestable in a Sublinear Number of Queries
Tomer Adar. Tight simulation of a distribution using conditional samples
Tomer Adar, Yahel Hotam and Amit Levi. When Local and Non-Local Meet: Quadratic Improvement for Edge Estimation with Independent Set Queries
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach and Yunya Zhao. Two-Sided Lossless Expanders in the Unbalanced Setting
Asaf Shapira and Nick Kushnir. Towards tight bounds for testing k-colorability
Clément Canonne and Nimitt Nimitt. Distributed Gaussian Mean Testing under Communication Constraints: messages, samples, and coins
Farzan Byramji, Daniel Kane, Jackson Morris and Anthony Ostuni. Hard-to-Sample Distributions from Robust Extractors
Ruben Ascoli, Bryce Frederickson, Sarah Frederickson, Caleb McFarland and Logan Post. Almost all graphs are vertex-minor universal
Ben Chen, Gil Cohen, Dean Doron, Yuval Khaskelberg and Amnon Ta-Shma. Improved Error Reduction for Weighted PRGs
Huck Bennett, Karthik Gajulapalli, Alexander Golovnev and Evelyn Warton. Output-Sparse Matrix Multiplication Using Compressed Sensing
Debarshi Chanda, Buddha Dev Das, Arijit Ghosh and Gopinath Mishra. From Decision to Random Certificates: Exponential Separation for Edge Estimation with Independent Set Queries
Yi Han. Glauber dynamics for random field Ising models on bounded degree graphs
Amir Azarmehr, Soheil Behnezhad, Alma Ghafari and Madhu Sudan. Markov Chains with Rewinding
Satyadev Nandakumar, Subin Pulari, Akhil S and Suronjona Sarma. One-Way Functions and Polynomial-Time Dimension
Weronika Wrzos-Kaminska. Recovering Planted Colorings in Sublinear Time
Shuichi Hirahara and Kazuki Ogitsuka. One-Sided-Error Parameterized Reductions for the Minimum Distance and Shortest Vector Problems
Vedat Levi Alev and Ori Parzanchevski. Sequential Sweeps and High Dimensional Expansion
Elyassaf Loyfer and Nati Linial. An Elementary Proof of the First LP Bound on the Rate of Binary Codes
Gal Maor and Gil Cohen. Ultra-Sparse Expanders and the Free Method
Clément Canonne, Yash Pote, Jonathan Scarlett and Qiping Yang. Entropy Equivalence Testing
Weiming Feng, Yucheng Fu, Minji Yang and Anqi Zhang. On Computing Total Variation Distance Between Mixtures of Product Distributions
Themistoklis Haris and Diptaksho Palit. Testing $k$-submodularity
Daniel Kane, Anthony Ostuni and Kewen Wu. Symmetric Distributions from Shallow Circuits
Haim Kaplan, Shay Sapir and Uri Stemmer. Load Balancing under Adaptive Bin Deletions
Arijit Bishnu, Debarshi Chanda and Gopinath Mishra. Arboricity Matters in Triangle Counting with Random Edges
Robert Andrews and Abhibhav Garg. An Improved Construction of Variety-Evasive Subspace Families
Daeho Lee, Shivam Nadimpalli, Mingda Qiao and Ronitt Rubinfeld. Testing Unate Distributions
Esty Kelman, Uri Meir, Debanuj Nayak and Sofya Raskhodnikova. Homomorphism Testing with Resilience to Online Manipulations
Flavio Chierichetti, Mirko Giacchini, Ravi Kumar and Erasmo Tani. On the LSH Distortion of Ulam and Cayley Similarities
Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro and Florian Speelman. Fine-Grained Complexity via Quantum Natural Proofs
Rohan Goyal, Venkatesan Guruswami, Yihang Sun and Mary Wootters. Locality of Curve Decoding and Improved Proximity Gaps
Renato Ferreira Pinto Jr., Cassandra Marcussen, Elchanan Mossel and Shivam Nadimpalli. Learning and Testing Convex Functions
Antonio Blanca and Md Tahmidur Rafid. Mixing and cutoff for the systematic scan dynamics of the mean-field ferromagnetic Potts model
Ivan Hu. Lifting Polynomials Using Error-Correcting Codes
Artur Czumaj and Christian Sohler. Property Testing of Computational Networks
Farzan Byramji, Daniel Kane, Jackson Morris and Anthony Ostuni. On the Advantage of Adaptivity for Sampling with Cell Probes
Rohan Goyal, Prahladh Harsha, Mrinal Kumar and Ashutosh Shankar. Fast list recovery of univariate multiplicity codes
Abhishek Dhawan, Nhi Dinh, Eren C. Kizildag, Neeladri Maitra and Bayram Alp Sahin. Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
Mandar Juvekar, Mark Bun and Samuel King. QMA Lower Bounds for Batch Verification via Approximate Degree
Uriya First and Stav Lazarovici. Good Locally Testable Codes with Small Alphabet and Small Query Size
Alireza Haqi, Aniket Das and Nima Anari. Parallel Sampling from the Ising $p$-Spin Model
Arjan Cornelissen, Amin Shiraz Gilani and Subhasree Patro. Quantum algorithms for path and cycle containment problems
Elena Grigorescu, Shreya Nasa and Cameron Seth. Testing the Independent Set Property in Hypergraphs
Max Hopkins. Toward a KKL Theorem for any HDX
Reut Levi and Bar Rushkin. Improved Local Computation of Edge Orientation
William Swartworth, David Woodruff and Samson Zhou. High Probability Streaming Lower Bounds for $F_2$ Estimation
Pravesh K. Kothari and Andrew D. Lin. Approximate Cauchy-Schwarz Inequality and Improved Bounds for Sherali-Adams Refutation of Semirandom CSPs
Antares Chen, Neng Huang and Kunal Marwaha. Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs