Journal Article
Random <i>k</i>-SAT: A tight threshold for moderately growing <i>k</i>
Clustering large graphs via the Singular Value Decomposition
Fast Monte-Carlo algorithms for finding low-rank approximations
A probabilistic analysis of randomly generated binary constraint satisfaction problems