- Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse. Transparency Beyond VNP in the Monotone Setting. Electronic Colloquium on Computational Complexity (ECCC), 29:31, 2022.
- Yogesh Dahiya, Meena Mahajan. On (Simple) Decision Tree Rank. Electronic Colloquium on Computational Complexity (ECCC), 29:1, 2022.
- Ivan Mihajlin, Anastasia Sofronova. A better-than-3logn depth lower bound for De Morgan formulas with restrictions on top gates. Electronic Colloquium on Computational Complexity (ECCC), TR22, 2022.
- C. Ramya, Anamay Tengse. On Finer Separations between Subclasses of Read-once Oblivious ABPs. Electronic Colloquium on Computational Complexity (ECCC), 29:9, 2022.
- Xin Lyu. Improved Pseudorandom Generators for $\mathrm{AC}^0$ Circuits. Electronic Colloquium on Computational Complexity (ECCC), 29:21, 2022.
- Iftach Haitner, Noam Mazor, Jad Silbak. Incompressiblity and Next-Block Pseudoentropy. Electronic Colloquium on Computational Complexity (ECCC), TR22, 2022.
- Oliver Korten. Efficient Low-Space Simulations From the Failure of the Weak Pigeonhole Principle. Electronic Colloquium on Computational Complexity (ECCC), 29:25, 2022.
- Ron D. Rothblum, Prashant Nalini Vasudevan. Collision-Resistance from Multi-Collision-Resistance. Electronic Colloquium on Computational Complexity (ECCC), 29:17, 2022.
- Louis Golowich, Salil P. Vadhan. Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), 29:24, 2022.
- Erfan Khaniki. Nisan-Wigderson generators in Proof Complexity: New lower bounds. Electronic Colloquium on Computational Complexity (ECCC), 29:23, 2022.