1. Fast probabilistic algorithms for hamiltonian circuits and matchings
2. Random Graphs, Academic, New York, 1985.
3. An algorithm for finding hamilton paths and cycles in random graphs
4. , and , Finding hidden Hamiltonian cycles, Proc. 23rd Annual ACM Symposium on Theory of Computing, May 1991, pp. 182–189.
5. Eigenvalues and graph bisection: an average-case analysis, Proc. 28th Annual Symposium on Foundations of Computer Science, October 1987, pp. 280–285.