Algebraic and Model Theoretical Methods in Constraint Satisfaction
Videos from BIRS Workshop
Michael Pinsker, Technische Universität Wien
Monday Nov 24, 2014 09:04 - 10:05
Tutorial 1: Constraint satisfaction problems on infinite domains
Peter Cameron, University of St Andrews
Monday Nov 24, 2014 10:31 - 11:25
Tutorial 2: Endomorphisms and synchronization: Synchronization, Part 1
Michael Pinsker, Technische Universität Wien
Monday Nov 24, 2014 14:10 - 15:12
Tutorial 1: Constraint satisfaction problems on infinite domains, Part 2
Ross Willard, University of Waterloo
Monday Nov 24, 2014 15:33 - 16:24
Tutorial 3: Universal algebra and CSP
Michael Pinsker, Technische Universität Wien
Tuesday Nov 25, 2014 09:05 - 10:01
Tutorial 1, Constraint satisfaction problems on infinite domains, Part 3
Peter Cameron, University of St Andrews
Tuesday Nov 25, 2014 10:21 - 11:18
Tutorial 2: Endomorphisms and synchronization: Graphs and transformation monoids, Part 2
Michal Wrona, Linköping University
Tuesday Nov 25, 2014 11:21 - 11:40
Algebraic Algorithms for the Inference Problem in Propositional Circumscription
Vera Koponen, Uppsala University
Tuesday Nov 25, 2014 13:31 - 14:27
Simple homogeneous structures
Andrei Krokhin, Durham University
Tuesday Nov 25, 2014 15:01 - 15:54
On constant-factor approximable finite-valued CSPs
Andras Pongracz, École Polytechnique
Tuesday Nov 25, 2014 16:31 - 16:54
Continuity of homomorphisms to the clone of projections
Peter Cameron, University of St Andrews
Wednesday Nov 26, 2014 09:02 - 10:00
Tutorial 2: Endomorphisms and synchronization: The almost synchronizing conjecture, Part 3
Barnaby Martin, Middlesex University
Wednesday Nov 26, 2014 10:23 - 10:48
Distance Constraint Satisfaction Problems
Zdenek Dvorak, Charles University
Wednesday Nov 26, 2014 10:48 - 11:20
Towards dichotomy for planar boolean CSP
Alexandr Kazda, Vanderbilt University
Wednesday Nov 26, 2014 11:21 - 11:44
Linear Datalog and k-permutability = symmetric Datalog
Gregory Cherlin, Rutgers, The State University of New Jersey
Thursday Nov 27, 2014 09:02 - 09:57
Classifying homogeneous structures
Libor Barto, Charles University
Thursday Nov 27, 2014 11:00 - 11:27
The basic CSP reductions revisited
Patrice Ossona de Mendez, Ecole des Hautes Etudes en Sciences Sociales
Thursday Nov 27, 2014 11:31 - 11:56
Restricted Dualities and First-Order Definable Colorings
Ralph McKenzie, Vanderbilt University
Thursday Nov 27, 2014 13:35 - 14:42
Absorption and directed Jonsson terms
Jan Hubicka, Charles University
Thursday Nov 27, 2014 15:00 - 15:29
Ramsey classes with algebraical closure and forbidden homomorphisms
Stanislav Zivny, University of Oxford
Thursday Nov 27, 2014 15:33 - 16:14
Necessary Conditions for Tractability of Valued CSPs
Matthew Moore, Vanderbilt University
Thursday Nov 27, 2014 16:18 - 16:44
Optimal strong Maltcev conditions for congruence meet-semidistributivity
Manuel Bodirsky, TU Dresden
Friday Nov 28, 2014 09:02 - 09:59
Challenges in Infinite-Domain Constraint Satisfaction
Victor Dalmau, University Pompeu Fabra
Friday Nov 28, 2014 10:32 - 10:59
Descriptive Complexity of approximate counting CSPs
