Self-Assembly of Discrete Self-Similar Fractals

Self-Assembly of Infinite Structures

Semidefinite programming and arithmetic circuit evaluation

Sensitivity versus block sensitivity of Boolean functions

Separating NOF communication complexity classes RP and NP

Separating the complexity classes NL and NP

Separations of Matroid Freeness Properties

Separations of non-monotonic randomness notions

Sets Have Simple Members

Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities

Settling the complexity of local max-cut (almost) completely

Shallow Circuits with High-Powered Inputs

Short Proofs for the Determinant Identities

Short Propositional Refutations for Dense Random 3CNF Formulas

Short Quantum Games

Shortest paths between shortest paths and independent sets

Signals for Cellular Automata in dimension 2 or higher

Simple extractors via constructions of cryptographic pseudo-random generators

Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory

Simulating Special but Natural Quantum Circuits