1. Correction to: Smooth and Strong PCPs

   • Orr Paradise

   Correction 10 June 2021 Article: 9

2. Blackbox identity testing for sum of special ROABPs and its border class

   • Pranav Bisht
   • Nitin Saxena

   OriginalPaper 10 June 2021 Article: 8

3. Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space

   • Jacobo Torán
   • Florian Wörz

   OriginalPaper Open access 01 May 2021 Article: 7

4. Lower Bounds for Matrix Factorization

   • Ben Lee Volk
   • Mrinal Kumar

   OriginalPaper 02 April 2021 Article: 6

5. Subquadratic-Time Algorithms for Normal Bases

   • Mark Giesbrecht
   • Armin Jamshidpey
   • Éric Schost

   OriginalPaper 02 March 2021 Article: 5

6. Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

   • Susanna F. De Rezende
   • Or Meir
   • Robert Robere

   OriginalPaper 12 February 2021 Article: 4

7. Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels

   • Ronen Shaltiel
   • Jad Silbak

   OriginalPaper 20 January 2021 Article: 3

8. Resolution with Counting: Dag-Like Lower Bounds and Different Moduli

   • Fedor Part
   • Iddo Tzameret

   OriginalPaper 08 January 2021 Article: 2

9. Smooth and Strong PCPs

   • Orr Paradise

   OriginalPaper 06 January 2021 Article: 1