- Alon Eden, Uriel Feige, Michal Feldman. Max-Min Greedy Matching. Theory of Computing, 18:1-33, 2022.
- Xinyu Wu. A Stochastic Calculus Approach to the Oracle Separation of BQP and PH. Theory of Computing, 18:1-11, 2022.
- Amey Bhangale, Subhash Khot. UG-hardness to NP-hardness by Losing Half. Theory of Computing, 18:1-28, 2022.
- Rocco A. Servedio, Li-Yang Tan. Improved Pseudorandom Generators from Pseudorandom Multi-switching Lemmas. Theory of Computing, 18:1-46, 2022.
- Per Austrin, Petteri Kaski, Kaie Kubjas. Tensor Network Complexity of Multilinear Maps. Theory of Computing, 18:1-54, 2022.
- Maya Leshkowitz. Round Complexity Versus Randomness Complexity in Interactive Proofs. Theory of Computing, 18:1-65, 2022.
- Alexander Kozachinskiy, Vladimir V. Podolskii. Multiparty Karchmer-Wigderson Games and Threshold Circuits. Theory of Computing, 18:1-33, 2022.
- Alexander Golovnev, Ishay Haviv. The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. Theory of Computing, 18:1-22, 2022.
- Emanuele Viola. Pseudorandom Bits and Lower Bounds for Randomized Turing Machines. Theory of Computing, 18:1-12, 2022.
- Andrew Drucker. Guest Editor's Foreword to the RANDOM 2018 Special Issue. Theory of Computing, 18:1-3, 2022.