Cs-Cc
Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
Graph Isomorphism is PSPACE-complete
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
Geometric Complexity Theory: Introduction
An approximation trichotomy for Boolean #CSP
A Polynomial-time Algorithm for Computing the Permanent in GF(3^q)
Constraint optimization and landscapes
On Recognizable Languages of Infinite Pictures
Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition
Faster subsequence recognition in compressed strings
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?
Intrinsically Universal Cellular Automata
Polynomial algorithms for protein similarity search for restricted mRNA structures
Parameterized Control Complexity in Fallback Voting
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
Choice numbers of graphs
A randomized polynomial-time algorithm for the Spanning Hypertree Problem on 3-uniform hypergraphs
Improved Monotone Circuit Depth Upper Bound for Directed Graph Reachability
An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
Causal sets from simple models of computation
On the approximability of robust spanning tree problems
