–
Existentially Polytime Theorems
Jack Edmonds (University of Waterloo)
–
Hypotheses about Satisfiability and their Consequences
Russell Impagliazzo (UC San Diego)
–
Total Function Problems in the Polynomial Hierarchy
Christos Papadimitriou (Columbia University)
–
On the Usefulness of the Strong Exponential Time Hypothesis
Ryan Williams (MIT)
–
Progress in Symbolic Satisfiability Solving
Moshe Vardi (Rice University)
–
On Symmetry and Quantification: A New Approach to Verify Distributed Protocols
Karem Sakallah (University of Michigan)
–
The Dawn of Computational Complexity Theory
Dick Karp (UC Berkeley)
–
Are we aging well?
Avi Wigderson (Institute for Advanced Study)
–
Belief and Survey Propagation
Amin Coja-Oghlan (Goethe University)
–
Information Efficiency of Proof Systems
Jan Krajicek (Charles University in Prague)
–
Proofs and Circuits: Connections via Interpolation and Lifting
Susanna de Rezende (Czech Academy of Sciences)
–
Short Proofs in Strong Proof Systems
Marijn Heule (Carnegie Mellon University)
–
SAT for Optimization
Fahiem Bacchus (University of Toronto)
–
Branching on Formulas: A Perspective From Knowledge Compilation
Adnan Darwiche (UCLA)
–
Classifying the Complexity of SAT and CSP: Are we there yet?
Andrei Krokhin (Durham University)
–
Complexity and Diversity
Les Valiant (Harvard University)
–
Where The Really Hard Problems Really Are?
Lenka Zdeborova (EPFL)
–
Strict NP: Expressive Power, Structure, and Complexity
Phokion Kolaitis (UC Santa Cruz  & IBM Research)
–
Constraint Satisfaction and Expansion
Irit Dinur (Weizmann Institute)
–
Symmetric Properties and Boolean Complexity
Alasdair Urquhart (University of Toronto)
–
Cooperative Competition: A New Way of Solving SAT and other NP-Hard Problems in AI and Beyond
Holger Hoos (Leiden University & University of British Columbia)
–
A Personal History of Practical SAT Solving
Armin Biere (Johannes Kepler University)
–
On Time, and Space, and Width, and Depth
Sasha Razborov (University of Chicago)