Dimitris__Achlioptas
A sharp threshold in proof complexity
Almost all graphs with average degree 4 are 3-colorable
Database-friendly random projections
Fast computation of low rank matrix approximations
Generating satisfiable problem instances
Optimal myopic algorithms for random 3-SAT
Sampling techniques for kernel methods
The analysis of a list-coloring algorithm on a random graph
The Asymptotic Order of the Random k-SAT Threshold
The phase transition in 1-in-k SAT and NAE 3-SAT