Fast monte-carlo algorithms for finding low-rank approximations
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Compact oracles for reachability and approximate distances in planar digraphs