Schedule

All times are Central European Summer Time

Monday 29 June

9.00-9.10Opening
9.10-10.30Tutorial. Martin Ziegler. Computable Analysis
10.30-11.00Coffee break
11.00-12.30Special session: HaPoC session on Fairness in Algorithms
Chairs:
Viola Schiaffonati and Teresa Scantamburlo
Talks:
Krishna Gummadi
Christoph Heitz
Anouk Ruhaak
Teresa Scantamburlo
11.00-12.30Special session: Combinatorial String Matching
Chairs:
Marinella Sciortino, Travis Gagie
Talks:
Inge Li Gørtz
Markus Lohrey
Cinzia Pizzi
Przemek Uznanski
12.30-14.00Lunch break
14.00-15.00Invited Talk: Paolo Boldi. Centralities in Network Analysis
15.00-16.00Invited Talk: Ekaterina Fokina. On-the-fly classification of structures
16.00-16.30Coffee break
16.30-17.30Invited talk: Damien Woods. Molecular algorithms using reprogrammable DNA self-assembly
17.30-17.55Kévin Perrot, Sylvain Sené and Lucas Venturini. #P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
17.30-17.55Peter Schuster and Daniel Wessel. The Computational Significance of Hausdorff’s Maximal Chain Principle.
17.30-17.55David Fernández-Duque and Andreas Weiermann. Ackermannian Goodstein sequences of intermediate growth
17.55-18.20Janos Makowsky. Congruences for Combinatorial Counting Functions.
17.55-18.20Antonio Boccuto and Arturo Carpi. Repetitions in Toeplitz words and the Thue threshold
17.55-18.20Andreas Weiermann. Goodstein principles and notation systems for natural numbers.

Tuesday 30 June

9.00-10.30Tutorial. Martin Ziegler. Computable Analysis
10.30-11.00Coffee break
11.00-12.00Invited Talk: Amaury Pouly. A Survey on Analog Models of Computation
12.00-14.30Social event and lunch break
14.30-16.00Special session: Computable Topology
Chairs:
Matthew de Brecht and Mathieu Hoyrup
Talks:
Matthias Schröder
Mariya Soskova
14.30-16.00Special session: Large Scale Bioinformatics and Computational Sciences
Chairs:
Gianluca Della Vedova and Iman Hajirasouliha
Talks:
Marco Aldinucci
Can Alkan
Valentina Boeva
Erik Garrison
16.00-16.30Coffee break
16.30-17.30Tutorial: Virginia Vassilevska Williams. Fine-Grained Complexity
17.30-18.30Women in Computability Workshop

Wednesday 1 July

9.30-10.30Invited Talk: Antonio Restivo. On the Repetitive Structure of Words
10.30-11.00Coffee break
11.00-12.30Special session: Special session on Algorithmic Learning Theory
Chairs:
Frank Stephan and Lorenzo Carlucci
Talks:
Amir Yehudayoff
Luca San Mauro
11.00-12.30Special session: Modern Aspects of Formal Languages
Chairs:
Markus L. Schmid and Rosalba Zizza
Talks:
Stavros Konstantinidis
Maria Madonia
12.30-14.00Lunch break
14.00-14.25Zuzana Haniková. On the complexity of validity degrees in Łukasiewicz logic
14.00-14.25Sune Kristian Jakobsen and Jakob Grue Simonsen. Liouville Numbers and the Computational Complexity of Changing Bases
14.00-14.25Makoto Fujiwara. Parallelizations in Weihrauch reducibility and constructive reverse mathematics
14.25-14.50Manuel Bodirsky, Simon Knäuer and Florian Starke. ASNP: a tame fragment of existential second-order logic
14.25-14.50Lars Kristiansen and Juvenal Murwanashyaka. On Interpretability between some weak essential undecidable theories
14.25-14.50Manlio Valenti. Finding descending sequences in ill-founded linear orders.
14.50-15.15Ulrich Berger, Olga Petrovska and Hideki Tsuiki. Prawf: An interactive proof system for Program extraction
14.50-15.15Lars Kristiansen and Jakob Grue Simonsen. On the Complexity of Conversion between Classic Real Number Representations
14.50-15.15Antonin Callard and Mathieu Hoyrup. Descriptive complexity on non-Polish spaces.
15.15-15.40Cyril Banderier and Massimiliano Goldwurm. Number of prefixes in trace monoids: clique polynomials and dependency graphs
15.15-15.40James Walsh and Patrick Lutz. Incompleteness and jump hierarchies.
15.15-15.40Linda Westrick. The recursion theorem in the Weihrauch lattice.
15.40-16.05Simone Rinaldi, Giulia Palma and Andrea Frosini. Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind sequences
15.40-16.05Alberto Termine and Giuseppe Primiero. Computational Logic for Uncertain Reasoning on Stochastic Systems.
15.40-16.05Tonicha Crook. The Weihrauch degree of finding Nash Equilibria in multiplayer games.
16.00-16.30Coffee break
16.30-17.30Tutorial: Virginia Vassilevska Williams. Fine-Grained Complexity
17.30-17.55Russell Miller. Non-coding enumeration operators
17.30-17.55Florian Bridoux, Maximilien Gadouleau and Guillaume Theyssier. On simulation in automata networks
17.30-17.55Vittorio Cipriani. Learning algebraic structures bounding the number of mistakes.
17.55-18.20Sarah Reitzes, Damir Dzhafarov and Denis Hirschfeldt. Reduction games, provability, and compactness.
17.55-18.20Martin Kutrib, Andreas Malcher, Carlo Mereghetti and Beatrice Palano. Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power
17.55-18.20Valentino Delle Rose. Word Problem and Ceers.

Thursday 2 July

9.40-10.05Ivan Adrian Koswara, Gleb Pogudin, Svetlana Selivanova and Martin Ziegler. Complexity of Linear PDEs: Iterative vs. Analytic Series Approach
9.40-10.05Matthew de Brecht. Some notes on spaces of ideals and computable topology
9.40-10.05Nicola Prezza and Giovanna Rosone. Faster Online Computation of the Succinct Longest Previous Factor Array
10.05-10.30Patrick Lutz and Benjamin Siskind. Part 1 of Martin’s Conjecture for Order Preserving Functions.
10.05-10.30Martin Vu and Henning Fernau. Insertion-Deletion Systems With Substitutions I
10.30-11.00Coffee break
11.00-12.30Special session: Modern Aspects of Formal Languages
Chairs:
Markus L. Schmid and Rosalba Zizza
Talks:
Joel D. Day
Wim Martens
11.00-12.30Special session: Computable Topology
Chairs:
Matthew de Brecht and Mathieu Hoyrup
Talks:
Alexander Melnikov
Takayuki Kihara
11.00-12.30Special session: Special session on Algorithmic Learning Theory
Chairs:
Frank Stephan and Lorenzo Carlucci
Talks:
Ziyuan Gao
Thomas Zeugmann
12.30-14.00Lunch break
14.00-15.00Véronique Bruyère. A game-theoretic approach for the automated synthesis of complex systems
15.00-15.25Sam Sanders. On the logical and computational properties of the uncountable.
15.00-15.25Iosif Petrakis. Functions of Baire class one over a Bishop topology
15.00-15.25Merlin Carl. Clockability for Ordinal Turing Machines
15.25-15.50Michał Tomasz Godziszewski and Luca San Mauro. Quotient structures, philosophy of computability theory and computational structuralism.
15.25-15.50Stephane Le Roux. Time-aware uniformization of winning strategies
15.25-15.50Nikolay Bazhenov and Stefan Vatev. A Note on Computable Embeddings for Ordinals and Their Reverses
16.00-16.30Coffee break
16.30-17.30Awarding the Barry Cooper prize to Bruno Courcelle
17.30-18.30AGM
18.30-18.45Conclusion and greetings