The Collapse of the Polynomial Hierarchy: NP = P (A Summary)
The communication complexity of XOR games via summing operators
The Complexity of 3SAT_N and the P versus NP Problem
The Complexity of Agreement
The Complexity of Approximately Counting Stable Matchings
The Complexity of Approximately Counting Stable Roommate Assignments
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract)
The Complexity of Approximating Bounded-Degree Boolean \sharp CSP
The Complexity of Boolean Constraint Isomorphism
The Complexity of Clickomania
The Complexity of Computing Minimal Unidirectional Covering Sets
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation)
The Complexity of Computing the Size of an Interval
The complexity of conservative finite-valued CSPs
The complexity of conservative valued CSPs
The Complexity of Counting Eulerian Tours in 4-Regular Graphs
The complexity of counting solutions to Generalised Satisfiability Problems modulo k
The Complexity of HCP in Digraps with Degree Bound Two
The Complexity of Iterated Strategy Elimination