Complexity and finite models (CMF 2011)
22nd, 23rd and 24th of June, 2011 - Paris

Programme

Wednesday, June 22nd (room 0C2)
(Morning JAF)
10:00 - 11:00Leszek Kolodziejczyk - Recursive Saturation of the Real Closure as a Tennenbaum-like Property
11:00 - 11:30Break
11:30 - 12:30Konrad Zdanowski - The strength of Ramsey theorem for coloring omega-large sets
12:30 - 13:00Daniel Leivant - The Comprehension Cube
(Afternoon CMF)
15:00 - 16:00Achim Blumensath - The Monadic Second-Order Transduction Hierarchy
16:00 - 16:30Break
16:30 - 17:15Sam Buss - Limits on Alternation-Trading Proofs for Time-Space Bounds on Satisfiability
17:15 - 18:00Stefan Mengel - Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
Thursday, June 23rd (room 0C5)
10:00 - 11:00Amir Yehudayoff - Rank bounds for design matrices with applications
11:00 - 11:30Break
11:30 - 12:15Irénée Briquel - 17e problème de Smale : une étude en précision finie
12:15 - 13:00Christian Konrad - The Streaming Complexity of Validating XML Documents
15:00 - 16:00Jakob Nordström - Understanding the Hardness of Proving Formulas in Propositional Logic
16:00 - 16:30Break
16:30 - 17:15Juha Kontinen - Complexity results for dependence logic
17:15 - 18:00Johann Brault-Baron - Acyclic Conjunctive Queries
20:00 - Dinner at l'Ambassade d'Auvergne
Friday, June 24th (room 0C5)
09:30 - 10:30Heribert Vollmer - Verifying proofs in constant depth
10:30 - 11:00Break
11:00 - 11:45Daniel Leivant - Turing in the sky: machines for the arithmetical and analytical hierarchies
11:45 - 12:30Vonjy Rasendrahasina - Combinatoire énumérative et analytique pour Max-2-XorSat et Max-Cut
Special session enumeration (ANR ENUM)
14:00 - 14:30Nadia Creignou - Enumerating All Solutions of a Boolean CSP by Non-Decreasing Weight
14:30 - 15:00Antoine Ndione - Testing Regular Word Languages Revisited