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 | 65 | 2015 |

Chasing the k-colorability threshold A Coja-Oghlan, D Vilenchik 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 380-389, 2013 | 63 | 2013 |

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 | 53 | 2016 |

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 | 48 | 2013 |

Complete convergence of message passing algorithms for some satisfiability problems U Feige, E Mossel, D Vilenchik Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006 | 45 | 2006 |

Solving random satisfiable 3 CNF formulas in expected polynomial time M Krivelevich, D Vilenchik SODA 6, 454-463, 2006 | 40 | 2006 |

Do semidefinite relaxations really solve sparse PCA R Krauthgamer, B Nadler, D Vilenchik arXiv preprint arXiv:1306.3690, 2013 | 33 | 2013 |

A spectral approach to analysing belief propagation for 3-colouring A Coja-Oghlan, E Mossel, D Vilenchik Combinatorics, Probability and Computing 18 (6), 881-912, 2009 | 31 | 2009 |

A local search algorithm for 3SAT U Feige, D Vilenchik Technical report, The Weizmann Institute of Science, 2004 | 27 | 2004 |

Small clique detection and approximate Nash equilibria L Minder, D Vilenchik Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009 | 21 | 2009 |

Semirandom models as benchmarks for coloring algorithms M Krivelevich, D Vilenchik 2006 Proceedings of the Third Workshop on Analytic Algorithmics and …, 2006 | 21 | 2006 |

The Chromatic Number of Random Graphs for Most Average Degrees^{}A Coja-Oghlan, D Vilenchik International Mathematics Research Notices 2016 (19), 5801-5859, 2016 | 20 | 2016 |

On smoothed *k*-CNF formulas and the Walksat algorithmA Coja-Oghlan, U Feige, A Frieze, M Krivelevich, D Vilenchik Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009 | 19 | 2009 |

Why Almost All *k*-Colorable Graphs Are EasyA Coja-Oghlan, M Krivelevich, D Vilenchik Annual Symposium on Theoretical Aspects of Computer Science, 121-132, 2007 | 17 | 2007 |

Why almost all satisfiable -CNF formulas are easy A Coja-Oghlan, M Krivelevich, D Vilenchik Discrete Mathematics and Theoretical Computer Science, 95-108, 2007 | 17 | 2007 |

The adaptive behavior of a soccer team: An entropy-based analysis Y Neuman, N Israeli, D Vilenchik, Y Cohen Entropy 20 (10), 758, 2018 | 14 | 2018 |

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 | 14 | 2007 |

Smoothed analysis of balancing networks T Friedrich, T Sauerwald, D Vilenchik Random Structures & Algorithms 39 (1), 115-138, 2011 | 12 | 2011 |

Complete convergence of message passing algorithms for some satisfiability problems U Feige, E Mossel, D Vilenchik Theory of Computing 9 (1), 617-651, 2013 | 9 | 2013 |

On the random satisfiable process M Krivelevich, B Sudakov, D Vilenchik Combinatorics, Probability and Computing 18 (5), 775-801, 2009 | 9 | 2009 |