A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.
Edge-disjoint routing in plane switch graphs in linear time.
Quantum lower bounds for the collision and the element distinctness problems.
Approximating extent measures of points.
Solving convex programs by random walks.
The random oracle methodology, revisited.