Complexity (30 January – 3 February)
9:00
9:30
10:00
10:30
11:00
11:30
12:00
12:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
-
Monday 30
- Yiannis N. Moschovakis, Relative complexity in arithmetic and algebra – part 1
- Pierre Valarcher, From intentional behavior to algorithmic completeness.
- Ugo Dal Lago, Higher-order Interpretations and Program Complexity (joint work with Patrick Baillot).
- Isabel Oitavem, NP with tier 0 pointers.
- Reinhard Kahle, Computational Complexity and Applicative Theories (joint work with Isabel Oitavem).
-
Tuesday 31
- Martin Hofmann, Pure pointer programs (implicit computational complexity) with an abstract datatype of pointers – part 1
- Yiannis N. Moschovakis, Relative complexity in arithmetic and algebra – part 2
- Emmanuel Hainry, Computable Analysis: Computability and complexity over the reals
- Marco Solieri, Deep into optimality Complexity and correctness of shared implementation of bounded logics.
- Matthieu Perrinel, Strong bound for light linear logic by levels
-
Wednesday 1
- Martin Hofmann, Pure pointer programs (implicit computational complexity) with an abstract datatype of pointers – part 2
- Neil Jones, Alan Turing and 75 years of research in models of computation
- Hippocampe: poster session by young (high school) mathematicians
- Thursday 2
-
Friday 3
- Stefan Szeider, Parametrized complexity – part 2
- Heribert Vollmer, Circuit complexity – Proof complexity
- Martin Lackner, Fixed-Parameter Algorithms for Finding Minimal Models (joint work with Andreas Pfandler).
- Contributed talks
- Johannes Schmidt, On the Parameterized Complexity of Default Logic and Autoepistemic Logic.