Dan Vilenchik
Title
Cited by
Cited by
Year
Chasing the k-colorability threshold
A Coja-Oghlan, D Vilenchik
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 380-389, 2013
612013
Do semidefinite relaxations solve sparse PCA up to the information limit?
R Krauthgamer, B Nadler, D Vilenchik
The Annals of Statistics 43 (3), 1300-1322, 2015
592015
The condensation phase transition in random graph coloring
V Bapst, A Coja-Oghlan, S Hetterich, F Raßmann, D Vilenchik
Communications in Mathematical Physics 341 (2), 543-606, 2016
492016
Complete convergence of message passing algorithms for some satisfiability problems
U Feige, E Mossel, D Vilenchik
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006
452006
How hard is counting triangles in the streaming model?
V Braverman, R Ostrovsky, D Vilenchik
International Colloquium on Automata, Languages, and Programming, 244-254, 2013
402013
Solving random satisfiable 3 CNF formulas in expected polynomial time
M Krivelevich, D Vilenchik
SODA 6, 454-463, 2006
382006
Do semidefinite relaxations really solve sparse PCA
R Krauthgamer, B Nadler, D Vilenchik
arXiv preprint arXiv:1306.3690, 2013
312013
A spectral approach to analyzing belief propagation for 3-coloring
A Coja-Oghlan, E Mossel, D Vilenchik
arXiv preprint arXiv:0712.0171, 2007
312007
A local search algorithm for 3SAT
U Feige, D Vilenchik
Technical report, The Weizmann Institute of Science, 2004
272004
Semirandom models as benchmarks for coloring algorithms
M Krivelevich, D Vilenchik
2006 Proceedings of the Third Workshop on Analytic Algorithmics and …, 2006
212006
Small clique detection and approximate Nash equilibria
L Minder, D Vilenchik
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
202009
Why almost all satisfiable -CNF formulas are easy
A Coja-Oghlan, M Krivelevich, D Vilenchik
202007
The Chromatic Number of Random Graphs for Most Average Degrees
A Coja-Oghlan, D Vilenchik
International Mathematics Research Notices 2016 (19), 5801-5859, 2016
182016
On smoothed k-CNF formulas and the Walksat algorithm
A Coja-Oghlan, U Feige, A Frieze, M Krivelevich, D Vilenchik
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
182009
Why Almost All k-Colorable Graphs Are Easy
A Coja-Oghlan, M Krivelevich, D Vilenchik
Annual Symposium on Theoretical Aspects of Computer Science, 121-132, 2007
172007
The adaptive behavior of a soccer team: An entropy-based analysis
Y Neuman, N Israeli, D Vilenchik, Y Cohen
Entropy 20 (10), 758, 2018
122018
Smoothed analysis of balancing networks
T Friedrich, T Sauerwald, D Vilenchik
Random Structures & Algorithms 39 (1), 115-138, 2011
122011
On the random satisfiable process
M Krivelevich, B Sudakov, D Vilenchik
arXiv preprint arXiv:0807.4326, 2008
102008
Why almost all k-CNF formulas are easy
A Coja-Oghlan, M Krivelevich, D Vilenchik
Proceedings of the 13th International Conference on Analysis of Algorithms …, 2007
92007
Constructing uniquely realizable graphs
I Pak, D Vilenchik
Discrete & Computational Geometry 50 (4), 1051-1071, 2013
72013
The system can't perform the operation now. Try again later.
Articles 1–20