SAT Has No Wizards

Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem

Scarf is Ppad-Complete

Schaefer's theorem for graphs

Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis

Schemes for Deterministic Polynomial Factoring

Scrabble is PSPACE-Complete

Self-Assembly of a Statistically Self-Similar Fractal

Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)

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