Accepted Papers

The following papers will be published in the Lecture Notes in Computer Science (LNCS) volume. Link to the proceedings.

Contributed Papers

  • Timothy McNicholl and Don Stull. The isometry degree of a computable copy of l^p
  • Achilles Beros, Mushfeq Khan, Bjørn Kjos-Hanssen and André Nies. From eventually different functions to pandemic numberings
  • Florent Becker, Diego Maldonado, Nicolas Ollinger and Guillaume Theyssier. Universality in Freezing Cellular Automata
  • Ivan Georgiev, Lars Kristiansen and Frank Stephan. On General Sum Approximations of Irrational Numbers
  • Alexey Milovanov. Algorithmic Statistics and Prediction for polynomial time-bounded algorithms
  • Lars Kristiansen and Juvenal Murwanashyaka. Decidable and Undecidable Fragments of First-Order Concatenation Theory
  • Douglas Cenzer and Diego Rojas. Online Computability and Differentiation in the Cantor Space
  • Alexander Rybalov. A generic m-reducibility
  • Dino Rossegger. Elementary bi-embeddability spectra of structures
  • Merlin Carl. Some Observations on Infinitary Complexity
  • Till Fluschnik, George B. Mertzios and André Nichterlein. Kernelization Lower Bounds for Finding Constant-Size Subgraphs
  • Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter and Rolf Niedermeier. Diminishable Parameterized Problems and Strict Polynomial Kernelization
  • Vladimir Uspenskiy and Alexander Shen. Algorithms and Geometric Constructions
  • Nikolay Bazhenov and Margarita Marchuk. Degrees of categoricity for prime and homogeneous models
  • Martin Monath. A c.e. weak truth table degree which is array noncomputable and r-maximal
  • Svetlana Selivanova and Victor Selivanov. Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended abstract)
  • Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola, Marco Previtali and Raffaella Rizzi. Divide and Conquer computation of the multi-string BWT and LCP array
  • Pavel Alaev and Victor Selivanov. Polynomial-time Presentations of Algebraic Number Fields (Extended abstract)
  • Sam Sanders. Some nonstandard equivalences in Reverse Mathematics
  • Margarita Korovina and Oleg Kudinov. Weak Reduction Principle and Computable Metric Spaces
  • Henning Fernau, Lakshmanan Kuppusamy and Rufus Oladele. New Nonterminal Complexity Results for Semi-Conditional Grammars
  • Ulrich Berger and Olga Petrovska. Optimised program extraction for induction and coinduction
  • Merlin Carl, Sabrina Ouazzani and Philip Welch. Taming Koepke’s Zoo
  • Marie Nicholson. The complexity of Tukey types and cofinal types.
  • Klaus Ambos-Spies. Multiple Permitting and Array Noncomputability
  • André Souto, Luis Antunes, Andreia Teixeira and Paulo Mateus. Witness hiding without extractors or simulators

Special Session Papers

  • Thomas Erlebach. Computing and Scheduling with Explorable Uncertainty
  • Sebastian Berndt and Kim-Manuel Klein. Using Structural Properties for Integer Programs
  • Sebastian Berndt. Computing Tree Width: From Theory to Practice and Back
  • Mathieu Hoyrup. Topological analysis of representations
  • Martin Davis. Turing’s Vision and Deep Learning
  • Christoph Benzmüller, Xavier Parent and Leon van der Torre. A Deontic Logic Reasoning Infrastructure
  • Daniel Graça and Ning Zhong. Computability of ordinary differential equations
  • Massimo Lauria. Algorithm analysis through proof complexity
  • Arno Pauly. Enumeration degrees and topology
  • Joao Marques-Silva. Computing with SAT Oracles: Past, Present & Future
  • Dag Normann. Functionals of Type 3 as Realisers of Classical Theorems in Analysis
  • Wilfried Sieg. What is the concept of computation?
  • Ishai Kones and Asaf Levin. A unified framework for designing EPTAS’s for load balancing on parallel machines
  • Takashi Yokomori and Fumiya Okubo. Computing with Multisets : A Survey on Reaction Automata Theory
  • Paula Quinon. A taxonomy of deviant encodings