Cs-Cc
The evaluation of geometric queries: constraint databases and quantifier elimination
Fast Hamiltonicity checking via bases of perfect matchings
Enumerable Distributions, Randomness, Dependence
Speeding up shortest path algorithms
Integer factoring and modular square roots
Inapproximability After Uniqueness Phase Transition in Two-Spin Systems
DNF Sparsification and a Faster Deterministic Counting Algorithm
The rapid points of a complex oscillation
Parameterized Complexity Results in Symmetry Breaking
On the uselessness of quantum queries
Adiabatic quantum optimization fails for random instances of NP-complete problems
Renormalization and Computation II: Time Cut-off and the Halting Problem
The Complexity of Weighted Boolean #CSP with Mixed Signs
Communication Complexities of XOR functions
A Short Introduction to Kolmogorov Complexity
Pebbles and Branching Programs for Tree Evaluation
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits
On sparse representations of linear operators and the approximation of matrix products
Pseudorandom Generators for Polynomial Threshold Functions
Expressing an NP-Complete Problem as the Solvability of a Polynomial Equation
Convex and linear models of NP-problems
Optimal Testing of Reed-Muller Codes
