Journal Article
The Cover Time of the Giant Component of a Random Graph (vol 32, pg 401, 2008)
A new approach to the planted clique problem
On the chromatic number of simple triangle-free triple systems
On the chromatic number of simple triangle-free triple systems
Random <i>k</i>-SAT:: the limiting probability for satisfiability for moderately growing <i>k</i>
Analco workshop preface