|
Search the dblp DataBase
Dan Vilenchik:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Uriel Feige, Elchanan Mossel, Dan Vilenchik
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. [Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:339-350 [Conf]
- Michael Krivelevich, Dan Vilenchik
Solving random satisfiable 3CNF formulas in expected polynomial time. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:454-463 [Conf]
- Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
Why Almost All k -Colorable Graphs Are Easy. [Citation Graph (0, 0)][DBLP] STACS, 2007, pp:121-132 [Conf]
Small Clique Detection and Approximate Nash Equilibria. [Citation Graph (, )][DBLP]
Delaying Satisfiability for Random 2SAT. [Citation Graph (, )][DBLP]
Smoothed Analysis of Balancing Networks. [Citation Graph (, )][DBLP]
On smoothed k-CNF formulas and the Walksat algorithm. [Citation Graph (, )][DBLP]
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring [Citation Graph (, )][DBLP]
On the random satisfiable process [Citation Graph (, )][DBLP]
Smoothed Analysis of Balancing Networks [Citation Graph (, )][DBLP]
On the Random Satisfiable Process. [Citation Graph (, )][DBLP]
A Spectral Approach to Analysing Belief Propagation for 3-Colouring. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|