21-22 Nov 2022 Montpellier (France)

Program

‹ Tuesday, November 22, 2022
09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
17:00
18:00
›9:30 (1h)
Albert Atserias: Are Average-Case Lower Bounds for Symmetric Boolean Circuits Within Reach?
Albert Atserias
› Salle 02-022 (JPN), Bât 5, Campus St Priest
›10:30 (30min)
Coffee break
› Salle 02-022 (JPN), Bât 5, Campus St Priest
›11:00 (30min)
Lars Jaffke: A logic-based algorithmic meta-theorem for mim-width
Lars Jaffke
› Salle 02-022 (JPN), Bât 5, Campus St Priest
›11:30 (30min)
Ignasi Sau: Compound Logics for Modification Problems
Ignasi Sau
› Salle 02-022 (JPN), Bât 5, Campus St Priest
›12:00 (30min)
Matthieu Rosenfeld: Bounding the number of sets defined by a given MSO formula on trees
Matthieu Rosenfeld
› Salle 02-022 (JPN), Bât 5, Campus St Priest
›12:30 (2h30)
Lunch
› Salle 02-022 (JPN), Bât 5, Campus St Priest
›15:00 (1h)
Anuj Dawar: Seese's conjecture: an update
Anuj Dawar
› Salle 02-022 (JPN), Bât 5, Campus St Priest
›16:00 (30min)
Coffee break
› Salle 02-022 (JPN), Bât 5, Campus St Priest
›16:30 (30min)
Kreutzer: Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Stephan Kreutzer
› Salle 02-022 (JPN), Bât 5, Campus St Priest
›17:00 (30min)
Mamadou Kanté: MSOL-definability of decompositions
Mamadou Kanté
› Salle 02-022 (JPN), Bât 5, Campus St Priest
›17:30 (30min)
Monadic NIP in monotone classes of relational structures - Ioannis Eleftheriadis
Ioannis Eleftheriadis
› Salle 02-022 (JPN), Bât 5, Campus St Priest
Session
Speech
Logistics
Break
Tour
Online user: 1 Privacy
Loading...