Space-Bounded Kolmogorov Extractors

Sparse Approximation is Hard

Spectral Algorithms for Unique Games

Speedup for Natural Problems and NP=?coNP

Spider Solitaire is NP-Complete

Spines of Random Constraint Satisfaction Problems: Definition and Connection with Computational Complexity

Stochastic Budget Optimization in Internet Advertising

Storage Enforcement with Kolmogorov Complexity and List Decoding

Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity

Strong direct product theorems for quantum communication and query complexity

Structure from Local Optima: Learning Subspace Juntas via Higher Order PCA

Subexponential fixed-parameter tractability of cluster editing

Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound

Sublogarithmic uniform Boolean proof nets

Subsampling Mathematical Relaxations and Average-case Complexity

Subspace Evasive Sets

Succinct quantum proofs for properties of finite groups

Succinctness of the Complement and Intersection of Regular Expressions

Succinctness of two-way probabilistic and quantum finite automata

Superiority of exact quantum automata for promise problems