- Noah Fleming, Christophe Marciot, Deniz imrek. Provably Total Functions in the Polynomial Hierarchy. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.
- Amnon Ta-Shma, Ben Chen. Better Weighted Pseudorandom Generators Against Low Weight Read-Once Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.
- Raghuvansh Saxena, Yael Tauman Kalai. Polynomial Size, Short-Circuit Resilient Circuits for NC. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.
- Jiatu Li. An Introduction to Feasible Mathematics and Bounded Arithmetic for Computer Scientists. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.
- Xin Li, Yan Zhong. Range Avoidance and Remote Point for Low-Depth Circuits: New Algorithms and Hardness. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.
- Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer. Parallel Repetition for 3-Player XOR Games. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.
- William Hoza, Zelin Lv. On Sums of INW Pseudorandom Generators. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.
- Oliver Korten, Toniann Pitassi, Russell Impagliazzo. Stronger Cell Probe Lower Bounds via Local PRGs. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.
- Michael Jaber, Vinayak M. Kumar, David Zuckerman. Linear Hashing Is Optimal. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.
- Siu On Chan, Hiu Tsun Ng. How Random CSPs Fool Hierarchies: II. Electronic Colloquium on Computational Complexity (ECCC), TR25, 2025.