The program:

Sunday, 13  
9:00--09:30 Registration
9:30--09:45 Opening
09:45--10:30 R. Kolpakov and G. Kucherov Searching for gapped palindromes. abstract
10:30--11:30 Alexander Tiskin Fast Distance Multiplication of Unit-Monge Matrices. abstract
11:30--12:00 Coffee break
12:00--13:00 Nicolas Bédaride Topological susbtitutions. abstract
13:00--15:00 Lunch
15:00--16:00 Vladimir Zhuravlev Quasicrystals: growth, form, complexity. abstract slides (6.5Mbytes)
16:00--16:45 Michael Rao Last Cases of Dejean's Conjecture. abstract slides
16:45--17:15 Coffee break
17:15--18:00 Alexander Chernyatiev Words with low complexity and interval exchange transformations.
18:00--18:45 Thierry Monteil Regularity and induction in symbolic dynamics. abstract
Monday, 14  
09:30--10:30Alexander KulikovCircuit Complexity and Multiplicative Complexity of Boolean Functions. abstract slides
10:30--11:00 Coffee break
11:00--12:00 Edward Hirsch Distributional proving problems.
12:00--13:00Dmitry ItsyksonThe complexity of inversion of Goldreich's function by backtracking algorithms. abstract
13:00--15:00 Lunch
15:00--16:00 Laurent BienvenuRandomly-generated fast growing functions. abstract
16:00--16:30 Mathieu HoyrupRandomness, computability and the ergodic decomposition. abstract slides
16:30--17:00 Coffee break
17:00--17:30 Stéphane VialettePattern matching in Vertex-Colored Graphs.
17:30--18:00 Mathieu Sablik Simulation of recursively enumerable subshifts by 2D SFT.
19:00 Workshop dinner
Tuesday, 15  
10:00--11:00 Nikolai Dolbilin Parallelohedra: classic theorems and new results.
11:00--11:30 Coffee break
11:30--12:15 Mikhail Thamm Zigzag model as a two-dimensional generalization of the ASEP model.
12:15--13:00 Thomas Fernique Growth of quasicrystals by a relaxation process. abstract
13:15--15:00 Lunch
15:00--16:00 Maxim Babenko Star packings in undirected graphs.
16:00--16:45 Mathieu RaffinotSplit decomposition of undirected graphs. abstract
16:45 Closing