• Krajicek, J (Charles University, Prague): Complexity of computations and proofs and pseudo-finite structures
• Galesi, N (Università degli Studi di Roma La Sapienza): Proof Complexity of Paris-Harrington Tautologies
• Kreutzer, S (Technische Universität Berlin): Logical Methods in the Complexity Analysis of Graph Algorithms
• Dantchev, S (Durham University): Parameterised Proof Complexity
• Beyerdorff, O (Università degli Studi di Roma La Sapienza): Parameterized Complexity of DPLL Search Procedures
• Yang, F (University of Helsinki): Model Checking for Modal Intuitionistic Dependence Logic
• Kontinen, J (University of Helsinki): Complexity results for dependence logic
• Atserias, A (Universitat Politècnica de Catalunya): Indistinguishability in Counting Logics and the Complexity of Semi-Algebraic Proofs
• Hamkins, JD (City University of New York): The hierarchy of equivalence relations on the natural numbers under computable reducibility
• Adams, R (University of London): Ordinal Strength of Logic-Enriched Type Theories
• Kreutzer, S (Technische Universität Berlin): Logical Methods in the Complexity Analysis of Graph Algorithms II
• Durand, A (Université Denis Diderot): The complexity of enumeration and counting for acyclic conjunctive queries
• Kopczynski, E (Uniwersytet Warszawski): Bounded degree and planar spectra
• Kullmann, O (Swansea University): SAT Solving: Present and Future
• Vardi, M (Rice University): Phase Transitions and Computational Complexity
• Hodges, A (University of Oxford): Alan Turing: the creative power of mathematics
• Santhanam, R (University of Edinburgh): Strong Lower Bounds for Constant-Depth Frege Imply Lower Bounds for Frege
• Johannsen, J (Ludwig-Maximilians-Universität München): Separations between propositional proof systems related to clause learning
• Eguchi, N (Tohoku University): Towards a New Theory of Bounded Arithmetic for PSPACE computations
• Buss, S (University of California, San Diego): NP search problems: Complexity and reducibilities
• Chen, Y (Shanghai Jiao Tong University): From almost optimal algorithms to logics for complexity classes via listings and a halting problem
• Lauria, M (Academy of Sciences of the Czech Republic): Space Complexity of Polynomial Calculus (joint work with Yuval Filmus, Jakob Nordstrom, Neil Thapen, Noga Zewi)
• Kolodziejczyk, L (Uniwersytet Warszawski): Toda's theorem in bounded arithmetic with parity quantifiers and bounded depth proof systems with parity gates
• Buss, S (University of California, San Diego): NP search problems: Provability and reducibilities
• Holm, B (University of Cambridge): Descriptive complexity of linear algebra
• Pakusa, W (RWTH Aachen University): Definability of linear equation systems over groups and rings
• Pich, J: Proof complexity of circuit lower bounds
• Nguyen, PT (Université de Montréal): Developing logical theories for several NP search classes
• Thapen, N (Academy of Sciences of the Czech Republic): Fragments of approximate counting
• Jerábek, E (Academy of Sciences of the Czech Republic): Root finding in TC^0 and open induction
• Lindell, S (Haverford College): Infinitary methods in finite model theory
• Schweikardt, N (Goethe-Universität Frankfurt): Locality from circuit lower bounds