| 2007 | ||
|---|---|---|
| 4 | EE | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik: Why Almost All k -Colorable Graphs Are Easy. STACS 2007: 121-132 |
| 3 | EE | Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik: A Spectral Approach to Analyzing Belief Propagation for 3-Coloring CoRR abs/0712.0171: (2007) |
| 2006 | ||
| 2 | EE | Uriel Feige, Elchanan Mossel, Dan Vilenchik: Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. APPROX-RANDOM 2006: 339-350 |
| 1 | EE | Michael Krivelevich, Dan Vilenchik: Solving random satisfiable 3CNF formulas in expected polynomial time. SODA 2006: 454-463 |
| 1 | Amin Coja-Oghlan | [3] [4] |
| 2 | Uriel Feige | [2] |
| 3 | Michael Krivelevich | [1] [4] |
| 4 | Elchanan Mossel | [2] [3] |