| 2019 | Recent Advances in the Computation of the Homology of Semialgebraic Sets. | Felipe Cucker |
| 2019 | Study of Stepwise Simulation Between ASM. | Patrick Cgielski, Julien Cervelle |
| 2019 | A Note on the Ordinal Analysis of \mathbf RCA_0 + \mathrm WO(\mathbf σ ) RCA 0 + WO ( σ ). | Lorenzo Carlucci, Leonardo Mainardi, Michael Rathjen |
| 2019 | Complexity of Maximum Fixed Point Problem in Boolean Networks. | Florian Bridoux, Nicolas Durbec, Kvin Perrot, Adrien Richard |
| 2019 | Towards Uniform Online Spherical Tessellations. | Paul C. Bell, Igor Potapov |
| 2019 | Complexity of Conjunctive Regular Path Query Homomorphisms. | Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gatan Richard |
| 2019 | Bounded Reducibility for Computable Numberings. | Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev |
| 2019 | Effective Embeddings for Pairs of Structures. | Nikolay Bazhenov, Hristo Ganchev, Stefan V. Vatev |
| 2019 | On the Differences and Sums of Strongly Computably Enumerable Real Numbers. | Klaus Ambos-Spies, Xizhong Zheng |
| 2019 | Non-Recursive Trade-Offs Are "Almost Everywhere". | Markus Holzer, Martin Kutrib |
| 2018 | Computing with Multisets: A Survey on Reaction Automata Theory. | Takashi Yokomori, Fumiya Okubo |
| 2018 | Algorithms and Geometric Constructions. | Vladimir Uspenskiy, Alexander Shen |
| 2018 | Witness Hiding Without Extractors or Simulators. | Andr Souto, Lus Antunes, Paulo Mateus, Andreia Teixeira |
| 2018 | What Is the Concept of Computation? | Wilfried Sieg |
| 2018 | Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract). | Svetlana V. Selivanova, Victor L. Selivanov |
| 2018 | Some Nonstandard Equivalences in Reverse Mathematics. | Sam Sanders |
| 2018 | A Generic m-Reducibility. | Alexander N. Rybalov |
| 2018 | Elementary Bi-embeddability Spectra of Structures. | Dino Rossegger |
| 2018 | A Taxonomy of Deviant Encodings. | Paula Quinon |
| 2018 | Enumeration Degrees and Topology. | Arno Pauly |
| 2018 | Functionals of Type 3 as Realisers of Classical Theorems in Analysis. | Dag Normann |
| 2018 | The Complexity of Tukey Types and Cofinal Types. | Marie Nicholson |
| 2018 | A C.E. Weak Truth Table Degree Which Is Array Noncomputable and R-maximal. | Martin Monath |
| 2018 | Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms. | Alexey Milovanov |
| 2018 | The Isometry Degree of a Computable Copy of 𝓁 | Timothy H. McNicholl, Don M. Stull |