Online load balancing and network flow
Checking approximate computations over the reals
Expanders that beat the eigenvalue bound
Efficient probabilistically checkable proofs and applications to approximations
Constructing small sample spaces satisfying given constraints
On the hardness of approximating minimization problems