| 2020 | #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method. Kévin Perrot, Sylvain Sené, Lucas Venturini |
| 2020 | A Note on Computable Embeddings for Ordinals and Their Reverses. Nikolay Bazhenov, Stefan V. Vatev |
| 2020 | ASNP: A Tame Fragment of Existential Second-Order Logic. Manuel Bodirsky, Simon Knäuer, Florian Starke |
| 2020 | Ackermannian Goodstein Sequences of Intermediate Growth. David Fernández-Duque, Andreas Weiermann |
| 2020 | Balancing Straight-Line Programs for Strings and Trees. Markus Lohrey |
| 2020 | Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly |
| 2020 | Clockability for Ordinal Turing Machines. Merlin Carl |
| 2020 | Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays. Andrea Frosini, Giulia Palma, Simone Rinaldi |
| 2020 | Computable Analysis and Classification Problems. Rodney G. Downey, Alexander G. Melnikov |
| 2020 | Degrees of Non-computability of Homeomorphism Types of Polish Spaces. Mathieu Hoyrup, Takayuki Kihara, Victor L. Selivanov |
| 2020 | Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
| 2020 | Faster Online Computation of the Succinct Longest Previous Factor Array. Nicola Prezza, Giovanna Rosone |
| 2020 | Formal Languages in Information Extraction and Graph Databases. Wim Martens |
| 2020 | Functions of Baire Class One over a Bishop Topology. Iosif Petrakis |
| 2020 | Insertion-Deletion Systems with Substitutions I. Martin Vu, Henning Fernau |
| 2020 | Liouville Numbers and the Computational Complexity of Changing Bases. Sune Kristian Jakobsen, Jakob Grue Simonsen |
| 2020 | Non-coding Enumeration Operators. Russell Miller |
| 2020 | Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs. Cyril Banderier, Massimiliano Goldwurm |
| 2020 | On Interpretability Between Some Weak Essentially Undecidable Theories. Lars Kristiansen, Juvenal Murwanashyaka |
| 2020 | On Simulation in Automata Networks. Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier |
| 2020 | On the Complexity of Conversion Between Classic Real Number Representations. Lars Kristiansen, Jakob Grue Simonsen |
| 2020 | On the Complexity of Validity Degrees in Łukasiewicz Logic. Zuzana Haniková |
| 2020 | On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings. Thomas Zeugmann |
| 2020 | On the Perceptron's Compression. Shay Moran, Ido Nachum, Itai Panasoff, Amir Yehudayoff |
| 2020 | Parallelizations in Weihrauch Reducibility and Constructive Reverse Mathematics. Makoto Fujiwara |
| 2020 | Prawf: An Interactive Proof System for Program Extraction. Ulrich Berger, Olga Petrovska, Hideki Tsuiki |
| 2020 | Quantitative Coding and Complexity Theory of Compact Metric Spaces. Donghyun Lim, Martin Ziegler |
| 2020 | Recent Advances in Text-to-Pattern Distance Algorithms. Przemyslaw Uznanski |
| 2020 | Repetitions in Toeplitz Words and the Thue Threshold. Antonio Boccuto, Arturo Carpi |
| 2020 | Some Notes on Spaces of Ideals and Computable Topology. Matthew de Brecht |
| 2020 | The Computational Significance of Hausdorff's Maximal Chain Principle. Peter Schuster, Daniel Misselbeck-Wessel |
| 2020 | Theoretical and Implementational Aspects of the Formal Language Server (LaSer). Stavros Konstantinidis |
| 2020 | Time-Aware Uniformization of Winning Strategies. Stéphane Le Roux |
| 2020 | Two-Dimensional Codes. Maria Madonia |