Response to Refutation of Aslam's Proof that NP = P

Restricted Complexity, General Complexity

Restricted Parameter Range Promise Set Cover Problems Are Easy

Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs

Restrictive Acceptance Suffices for Equivalence Problems

Reversal Complexity Revisited

Revisiting the Complexity of And/Or Graph Solution

Robust Coin Flipping

Robust Reductions

Robust Simulations and Significant Separations

Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping

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)