- Yaroslav Alekseev, Yuval Filmus, Alexander Smal. Lifting dichotomies. 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.
- Mrinal Kumar 0001, Varun Ramanathan 0002, Ramprasad Saptharishi, Ben lee Volk. Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Huck Bennett, Surendra Ghentiyala, Noah Stephens-Davidowitz. The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Pranav Bisht, Nikhil Gupta 0012, Prajakta Nimbhorkar, Ilya Volkovich. Launching Identity Testing into (Bounded) Space. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Sasank Mouli. Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann. Proof Complexity of Propositional Model Counting. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Shuichi Hirahara, Naoto Ohsaka. Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Dor Minzer, Kai Zhe Zheng. Near Optimal Alphabet-Soundness Tradeoff PCPs. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.
- Prasad Chaugule, Nutan Limaye. On the closures of monotone algebraic classes and variants of the determinant. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024.