| 2021 | Computability of Limit Sets for Two-Dimensional Flows. | Daniel Silva Graa, Ning Zhong |
| 2021 | On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics. | Eric Goles, Pedro Montealegre, Martn Ros-Wilson, Guillaume Theyssier |
| 2021 | Dedekind Cuts and Long Strings of Zeros in Base Expansions. | Ivan Georgiev |
| 2021 | Defining Formal Explanation in Classical Logic by Substructural Derivability. | Francesco A. Genco, Francesca Poggiolesi |
| 2021 | Probabilistic Models of k-mer Frequencies (Extended Abstract). | Askar Gafurov, Toms Vinar, Brona Brejov |
| 2021 | A Church-Turing Thesis for Randomness? | Johanna N. Y. Franklin |
| 2021 | Placing Green Bridges Optimally, with a Multivariate Analysis. | Till Fluschnik, Leon Kellerhals |
| 2021 | On False Heine/Borel Compactness Principles in Proof Mining. | Fernando Ferreira |
| 2021 | Limitwise Monotonic Spectra and Their Generalizations. | Marat Kh. Faizrahmanov |
| 2021 | On 3SUM-hard Problems in the Decision Tree Model. | Esther Ezra |
| 2021 | Walk-Preserving Transformation of Overlapped Sequence Graphs into Blunt Sequence Graphs with GetBlunted. | Jordan M. Eizenga, Ryan Lorig-Roach, Melissa M. Meredith, Benedict Paten |
| 2021 | Normal Forms for Semantically Witness-Based Learners in Inductive Inference. | Vanja Doskoc, Timo Ktzing |
| 2021 | Mapping Monotonic Restrictions in Inductive Inference. | Vanja Doskoc, Timo Ktzing |
| 2021 | Positive Enumerable Functors. | Barbara F. Csima, Dino Rossegger, Daniel Yu |
| 2021 | Formally Computing with the Non-computable. | Liron Cohen |
| 2021 | A Tale of Optimizing the Space Taken by de Bruijn Graphs. | Rayan Chikhi |
| 2021 | Restrictions of Hindman's Theorem: An Overview. | Lorenzo Carlucci |
| 2021 | Randomising Realizability. | Merlin Carl, Lorenzo Galeotti, Robert Pamann |
| 2021 | The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines. | Merlin Carl |
| 2021 | Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry. | Karl Bringmann |
| 2021 | On the Degrees of Constructively Immune Sets. | Samuel D. Birns, Bjrn Kjos-Hanssen |
| 2021 | Robust Online Algorithms for Dynamic Choosing Problems. | Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche |
| 2021 | Learning Languages with Decidable Hypotheses. | Julian Berger, Maximilian Bther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Ktzing, Winfried Ltzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger |
| 2021 | On Measure Quantifiers in First-Order Arithmetic. | Melissa Antonelli, Ugo Dal Lago, Paolo Pistone |
| 2021 | Searching for Applicable Versions of Computable Structures. | Pavel Alaev, Victor L. Selivanov |