| 1 | -- | 0 | Orr Paradise. Smooth and Strong PCPs |
| 2 | -- | 0 | Fedor Part, Iddo Tzameret. Resolution with Counting: Dag-Like Lower Bounds and Different Moduli |
| 3 | -- | 0 | Ronen Shaltiel, Jad Silbak. Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels |
| 4 | -- | 0 | Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere. Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling |
| 5 | -- | 0 | Mark Giesbrecht, Armin Jamshidpey, Éric Schost. Subquadratic-Time Algorithms for Normal Bases |
| 6 | -- | 0 | Ben lee Volk, Mrinal Kumar 0001. Lower Bounds for Matrix Factorization |
| 7 | -- | 0 | Jacobo Torán, Florian Wörz. Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space |
| 8 | -- | 0 | Pranav Bisht, Nitin Saxena 0001. Blackbox identity testing for sum of special ROABPs and its border class |
| 9 | -- | 0 | Orr Paradise. Correction to: Smooth and Strong PCPs |