- Paul Beame, Niels Kornerup. Cumulative Memory Lower Bounds for Randomized and Quantum Computation. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023.
- Prerona Chatterjee, Pavel Hrubes. New Lower Bounds against Homogeneous Non-Commutative Circuits. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023.
- Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran. Diagonalization Games. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023.
- Noam Mazor. A Lower Bound on the Share Size in Evolving Secret Sharing. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023.
- Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah. Linear threshold functions in decision lists, decision trees, and depth-2 circuits. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023.
- Deepanshu Kush, Shubhangi Saraf. Near-Optimal Set-Multilinear Formula Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023.
- Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals. Proving Unsatisfiability with Hitting Formulas. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023.
- Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang. On linear-algebraic notions of expansion. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023.
- Nader H. Bshouty. Superpolynomial Lower Bounds for Learning Monotone Classes. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023.
- Pooya Hatami, William Hoza. Theory of Unconditional Pseudorandom Generators. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023.