- Daniel Avraham, Amir Yehudayoff. On Blocky Ranks Of Matrices. Computational Complexity, 33(1):2, June 2024.
- Ferenc Bencs, Jeroen Huijben, Guus Regts. Approximating the chromatic polynomial is as hard as computing it exactly. Computational Complexity, 33(1):1, June 2024.
- Ilario Bonacina, Nicola Galesi, Massimo Lauria. On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. Computational Complexity, 32(2):12, December 2023.
- Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich. The Power of Natural Properties as Oracles. Computational Complexity, 32(2):6, December 2023.
- Caroline Mattes, Armin Weiß. Parallel algorithms for power circuits and the word problem of the Baumslag group. Computational Complexity, 32(2):10, December 2023.
- Ashrujit Ghoshal, Ilan Komargodski. On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. Computational Complexity, 32(2):9, December 2023.
- Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt. On sets of linear forms of maximal complexity. Computational Complexity, 32(1):1, 2023.
- Rishabh Batra, Nitin Saxena 0001, Devansh Shringi. Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q. Computational Complexity, 32(1):2, 2023.
- Pascal Koiran, Subhayan Saha. Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond. Computational Complexity, 32(2):8, December 2023.
- Oded Goldreich 0001, Dana Ron. A Lower Bound on the Complexity of Testing Grained Distributions. Computational Complexity, 32(2):11, December 2023.