1. A Spectral Technique for Coloring Random 3-Colorable Graphs
2. Finding a large hidden clique in a random graph
3. , , The probabilistic method, Wiley, New York, 2002.
4. , Eigenvalues and Graph Bisection: An Average-Case analysis, Proc 28th Annu Symp Foundations of Computer Science, 1987, pp. 280-285.
5. , , Coloring bipartite hypergraphs, IPCO: 5th Integer Programming and Combinatorial Optimization Conf, 1996, pp. 345-358.