| 2021 | Shelah-Stupp's and Muchnik's Iterations Revisited. | Pawel Parys |
| 2021 | On Closed-Rich Words. | Olga G. Parshina, Svetlana Puzynina |
| 2021 | Large Clique is Hard on Average for Resolution. | Shuo Pang |
| 2021 | Input-Driven Pushdown Automata on Well-Nested Infinite Strings. | Alexander Okhotin, Victor L. Selivanov |
| 2021 | On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs. | Zeev Nutov |
| 2021 | Approximation Algorithms for Connectivity Augmentation Problems. | Zeev Nutov |
| 2021 | Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata. | Augusto Modanese |
| 2021 | Predictions and Algorithmic Statistics for Infinite Sequences. | Alexey Milovanov |
| 2021 | A PCP of Proximity for Real Algebraic Polynomials. | Klaus Meer |
| 2021 | Upper Bound for Torus Polynomials. | Vaibhav Krishan |
| 2021 | A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards. | Hiroto Koyama, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone |
| 2021 | Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations. | Ivan Koswara, Gleb Pogudin, Svetlana Selivanova, Martin Ziegler |
| 2021 | Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection. | Florent Koechlin, Pablo Rotondo |
| 2021 | Average-Case Rigidity Lower Bounds. | Xuangui Huang, Emanuele Viola |
| 2021 | Limitations of Sums of Bounded Read Formulas and ABPs. | Purnata Ghosal, B. V. Raghavendra Rao |
| 2021 | Approximation Schemes for Multiperiod Binary Knapsack Problems. | Zuguang Gao, John R. Birge, Varun Gupta |
| 2021 | Upper Bounds on Communication in Terms of Approximate Rank. | Anna Gl, Ridwan Syed |
| 2021 | Dichotomy Result on 3-Regular Bipartite Non-negative Functions. | Austen Z. Fan, Jin-Yi Cai |
| 2021 | Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization. | Pranjal Dutta |
| 2021 | Dynamic Complexity of Expansion. | Samir Datta, Anuj Tawari, Yadu Vasudev |
| 2021 | Variants of the Determinant Polynomial and the VP-Completeness. | Prasad Chaugule, Nutan Limaye, Shourya Pandey |
| 2021 | Injective Colouring for H-Free Graphs. | Jan Bok, Nikola Jedlickov, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | Computational Complexity of Multi-player Evolutionarily Stable Strategies. | Manon Blanc, Kristoffer Arnsfelt Hansen |
| 2021 | On the Computational Complexity of Reaction Systems, Revisited. | Markus Holzer, Christian Rauch |
| 2020 | Tandem Duplications, Segmental Duplications and Deletions, and Their Applications. | Binhai Zhu |