 | 2009 |
|---|
| 10 |       | Lorenz Minder,
Dan Vilenchik:
Small Clique Detection and Approximate Nash Equilibria.
APPROX-RANDOM 2009: 673-685 |
| 9 | | Tobias Friedrich,
Thomas Sauerwald,
Dan Vilenchik:
Smoothed Analysis of Balancing Networks.
ICALP (2) 2009: 472-483 |
| 8 | | Amin Coja-Oghlan,
Uriel Feige,
Alan M. Frieze,
Michael Krivelevich,
Dan Vilenchik:
On smoothed k-CNF formulas and the Walksat algorithm.
SODA 2009: 451-460 |
| 2008 |
|---|
| 7 | | Michael Krivelevich,
Benny Sudakov,
Dan Vilenchik:
On the random satisfiable process
CoRR abs/0807.4326: (2008) |
| 6 | | Julia Böttcher,
Dan Vilenchik:
On the tractability of coloring semirandom graphs.
Inf. Process. Lett. 108(3): 143-149 (2008) |
| 2007 |
|---|
| 5 | | Amin Coja-Oghlan,
Michael Krivelevich,
Dan Vilenchik:
Why Almost All k -Colorable Graphs Are Easy.
STACS 2007: 121-132 |
| 4 | | Amin Coja-Oghlan,
Elchanan Mossel,
Dan Vilenchik:
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring
CoRR abs/0712.0171: (2007) |
| 3 | | Dan Vilenchik:
It's All about the Support: A New Perspective on the Satisfiability Problem.
JSAT 3(3-4): 125-139 (2007) |
| 2006 |
|---|
| 2 | | Uriel Feige,
Elchanan Mossel,
Dan Vilenchik:
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems.
APPROX-RANDOM 2006: 339-350 |
| 1 | | Michael Krivelevich,
Dan Vilenchik:
Solving random satisfiable 3CNF formulas in expected polynomial time.
SODA 2006: 454-463 |
