Solving the P/NP Problem under Intrinsic Uncertainty

Solving the Rural Postman problem using the Adleman-Lipton model

Some Applications of Coding Theory in Computational Complexity

Some Considerations on Universality

Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial

Some remarks on the survey decimation algorithm for K-satisfiability

Some results on equivalence of multi-letter quantum finite automata

Some results on more flexible versions of Graph Motif

Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs

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