- Shuichi Hirahara, Mikito Nanashima. One-Way Functions and Zero Knowledge. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Oliver Korten, Toniann Pitassi. Strong vs. Weak Range Avoidance and the Linear Ordering Principle. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Xinyu Mao, Guangxu Yang, Jiapeng Zhang. Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Swastik Kopparty, Amnon Ta-Shma, Kedem Yakirevitch. Character sums over AG codes. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Yaroslav Alekseev, Yuval Filmus, Alexander Smal. Lifting dichotomies. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Vaibhav Krishan, Sundar Vishwanathan. Towards ACC Lower Bounds using Torus Polynomials. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Noam Mazor, Rafael Pass. Gap MCSP is not (Levin) NP-complete in Obfustopia. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Mi-Ying (Miryam) Huang, Xinyu Mao, Guangxu Yang, Jiapeng Zhang. Breaking Square-Root Loss Barriers via Min-Entropy. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi. Improved Lower Bounds for 3-Query Matching Vector Codes. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Robert Andrews 0003, Avi Wigderson. Constant-Depth Arithmetic Circuits for Linear Algebra Problems. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.