Dan Vilenchik

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

8EEAmin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik: On smoothed k-CNF formulas and the Walksat algorithm. SODA 2009: 451-460
7EEMichael Krivelevich, Benny Sudakov, Dan Vilenchik: On the random satisfiable process CoRR abs/0807.4326: (2008)
6EEJulia Böttcher, Dan Vilenchik: On the tractability of coloring semirandom graphs. Inf. Process. Lett. 108(3): 143-149 (2008)
5EEAmin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik: Why Almost All k -Colorable Graphs Are Easy. STACS 2007: 121-132
4EEAmin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik: A Spectral Approach to Analyzing Belief Propagation for 3-Coloring CoRR abs/0712.0171: (2007)
3EEDan Vilenchik: It's All about the Support: A New Perspective on the Satisfiability Problem. JSAT 3(3-4): 125-139 (2007)
2EEUriel Feige, Elchanan Mossel, Dan Vilenchik: Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. APPROX-RANDOM 2006: 339-350
1EEMichael Krivelevich, Dan Vilenchik: Solving random satisfiable 3CNF formulas in expected polynomial time. SODA 2006: 454-463

Coauthor Index

1Julia Böttcher [6]
2Amin Coja-Oghlan [4] [5] [8]
3Uriel Feige [2] [8]
4Alan M. Frieze [8]
5Michael Krivelevich [1] [5] [7] [8]
6Elchanan Mossel [2] [4]
7Benny Sudakov [7]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)