- Ben lee Volk, Mrinal Kumar 0001. Lower Bounds for Matrix Factorization. Computational Complexity, 30(1):6, 2021.
- Orr Paradise. Smooth and Strong PCPs. Computational Complexity, 30(1):1, 2021.
- Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere. Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Computational Complexity, 30(1):4, 2021.
- Mark Giesbrecht, Armin Jamshidpey, Éric Schost. Subquadratic-Time Algorithms for Normal Bases. Computational Complexity, 30(1):5, 2021.
- Ronen Shaltiel, Jad Silbak. Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. Computational Complexity, 30(1):3, 2021.
- Fedor Part, Iddo Tzameret. Resolution with Counting: Dag-Like Lower Bounds and Different Moduli. Computational Complexity, 30(1):2, 2021.
- Thomas Watson 0001. Correction to: Communication complexity with small advantage. Computational Complexity, 29(1):3, 2020.
- Hiro Ito, Areej Khoury, Ilan Newman. On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs. Computational Complexity, 29(1):1, 2020.
- Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe 0001. The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. Computational Complexity, 29(2):7, 2020.
- Ilia Ponomarenko, Andrey Vasil'ev. Two-closures of supersolvable permutation groups in polynomial time. Computational Complexity, 29(1):5, 2020.