| 2017 | Towards Computable Analysis on the Generalised Real Line. | Lorenzo Galeotti, Hugo Nobrega |
| 2017 | Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups. | Martin Delacourt, Nicolas Ollinger |
| 2017 | Infinite Time Busy Beavers. | Oscar Defrain, Bruno Durand, Grgory Lafitte |
| 2017 | New Bounds on the Strength of Some Restrictions of Hindman's Theorem. | Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski |
| 2017 | The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters. | Merlin Carl, Philipp Schlicht |
| 2017 | Koepke Machines and Satisfiability for Infinitary Propositional Languages. | Merlin Carl, Benedikt Lwe, Benjamin G. Rin |
| 2017 | Admissibles in Gaps. | Merlin Carl, Bruno Durand, Grgory Lafitte, Sabrina Ouazzani |
| 2017 | Flexible Indexing of Repetitive Collections. | Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot |
| 2017 | Degrees of Categoricity of Rigid Structures. | Nikolay Bazhenov, Mars M. Yamaleev |
| 2017 | Turing Computable Embeddings, Computable Infinitary Equivalence, and Linear Orders. | Nikolay Bazhenov |
| 2017 | Counting Substrate Cycles in Topologically Restricted Metabolic Networks. | Robert D. Barish, Akira Suyama |
| 2017 | A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy. | Stefan Arnold, Jacobo Torn |
| 2017 | A Universal Oracle for Signal Machines. | Thierry Monteil |
| 2016 | Computable Reductions and Reverse Mathematics. | Reed Solomon |
| 2016 | A Direct Constructive Proof of a Stone-Weierstrass Theorem for Metric Spaces. | Iosif Petrakis |
| 2016 | Partial Orders and Immunity in Reverse Mathematics. | Ludovic Patey |
| 2016 | AFCAL and the Emergence of Computer Science in France: 1957-1967. | Pierre-ric Mounier-Kuhn, Mal Pgny |
| 2016 | Baire Category Theory and Hilbert's Tenth Problem Inside \mathbb Q Q. | Russell Miller |
| 2016 | The Complexity of Counting Quantifiers on Equality Languages. | Barnaby Martin, Andrs Pongrcz, Michal Wrona |
| 2016 | Types in Programming Languages, Between Modelling, Abstraction, and Correctness - Extended Abstract. | Simone Martini |
| 2016 | Ergodicity of Noisy Cellular Automata: The Coupling Method and Beyond. | Irne Marcovici |
| 2016 | On the Executability of Interactive Computation. | Bas Luttik, Fei Yang |
| 2016 | On the Lattices of Effectively Open Sets. | Oleg V. Kudinov, Victor L. Selivanov |
| 2016 | The Boolean Algebra of Piecewise Testable Languages. | Anton Konovalov, Victor L. Selivanov |
| 2016 | Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. | Akitoshi Kawamura, Florian Steinberg, Martin Ziegler |