Skip to main content

Programme

 Journées CMF

Les journées CMF auront lieu du mardi 17 midi au mercredi 18 midi.

Mardi après-midi 13h30 à 18h00

  • Yann Strozecki (PRISM) The complexity of almost acyclic simple stochastic games.
  • Nicolas Bacquey (GREYC)  Language recognition on cyclic cellular automata.
  • François Bossière (LIX) On the Complexity of Set-CSPs.
  • Amélie Gheerbrant (LIAFA) When is naive evaluation possible?
  • Nadime Francis (LSV) Datalog Rewritings of Regular Path Queries using Views.
  • Mamadou Kanté (LIMOS) A polynomial delay algorithm for the enumeration of minimal edge dominating sets in graphs.

Mercredi matin 9h00 à 12h00

  • Dietmar Berwanger Cachan (LSV) Directed graph measures.
  • Fabien Givors (LIRMM) Subcomputabilities.
  • Amaury Pouly (LIX) Study of an analog computer, from computability to complexity and links with computations on real numbers.
  • Pierre Bourhis (CNRS LIFL/INRIA Lille) Containment of monadic datalog for general structures.

Le programme détaillé / Detailed program [pdf].

 

EG'60 - Journées en l'honneur d'Etienne Grandjean

Mercredi 18 décembre /  Wednesday december, 18

  •  14h - 15h15 Serge Grigorieff (Paris 7), "A propos d'Etienne (about Etienne)" suivi de "Formalization of the notion of sequential algorithm"
  • 15h15 - 15h45 Pause café / Coffee break
  • 15h45 - 16h30 Georg Gottlob (Oxford), "Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics"
  • 16h30 - 17h15 Nicole Schweikardt (Frankfurt am Main),  "Enumerating First-Order Queries over Databases of Low Degree"
  • 17h15 - 17h30 Nadia Creignou, Frédéric Olive (Marseille) : "Nuages"
  • 19h30 Diner / Dinner (rendez-vous at the Café Mancel at 19h15)

Jeudi 19 décembre / Thursday december, 19

  • 9h  Accueil "petit déjeuner" / Wellcome breakfast
  • 9h30 - 10h15  Neil Immerman (UMass Amherst), "Descriptive and Dynamic Complexity"
  • 10h15 - 11h  Thomas Schwentick (Dortmund), "Inside DynFO"
  • 11h-11h30 Pause café / Coffee break
  • 11h30 - 12h15 Jean-Yves Marion (Nancy), "Evolving graph structures, non-interference, and complexity"
  • 12h30 Buffet / Lunch
     

Programme détaillé avec résumés / Detailed program with abstract [pdf]