| 1 | -- | 36 | Igor Pak, Greta Panova. On the complexity of computing Kronecker coefficients |
| 37 | -- | 77 | Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan. Sparse affine-invariant linear codes are locally testable |
| 79 | -- | 118 | Baris Aydinlioglu, Dieter van Melkebeek. Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games |
| 119 | -- | 145 | Salman Beigi, Omid Etesami, Amin Gohari. The Value of Help Bits in Randomized and Average-Case Complexity |
| 147 | -- | 197 | Gábor Braun, Rahul Jain 0001, Troy Lee, Sebastian Pokutta. Information-theoretic approximations of the nonnegative rank |
| 199 | -- | 228 | Rahul Jain 0001, Zhaohui Wei, Penghui Yao, Shengyu Zhang. Multipartite Quantum Correlation and Communication Complexities |
| 229 | -- | 273 | Amir Shpilka, Avishay Tal, Ben lee Volk. On the Structure of Boolean Functions with Small Spectral Norm |
| 275 | -- | 321 | Russell Impagliazzo, Valentine Kabanets. Fourier Concentration from Shrinkage |