Cs-Cc
On the Complexity of Trial and Error
On the rank of $ntimes n$ matrix multiplication
Random k-SAT and the Power of Two Choices
Polynomial Path Orders: A Maximal Model
Can Quantum Communication Speed Up Distributed Computation?
Turing Patterns with Turing Machines: Emergence and Low-level Structure Formation
Insertion and Sorting in a Sequence of Numbers Minimizing the Maximum Sum of a Contiguous Subsequence
On Exact Algorithms for Permutation CSP
Clique in 3-track interval graphs is APX-hard
Communication-Optimal Parallel Algorithm for Strassens Matrix Multiplication
Short lists for shortest descriptions in short time
An algebraic approach to symmetric extended formulations
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
Streaming algorithms for recognizing nearly well-parenthesized expressions
Computational Aspects of Dependence Logic
Exponential Time Complexity of the Permanent and the Tutte Polynomial
On the computational complexity of finding hard tautologies
Hardness of approximation for quantum problems
Topological approach to solve P versus NP
Subtraction makes computing integers faster
Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds
Checking generalized debates with small space and randomness
