Do semidefinite relaxations solve sparse PCA up to the information limit? R Krauthgamer, B Nadler, D Vilenchik | 84 | 2015 |

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

How hard is counting triangles in the streaming model? V Braverman, R Ostrovsky, D Vilenchik Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 67 | 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, 543-606, 2016 | 65 | 2016 |

Complete convergence of message passing algorithms for some satisfiability problems U Feige, E Mossel, D Vilenchik International Workshop on Approximation Algorithms for Combinatorial …, 2006 | 49 | 2006 |

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

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 | 38 | 2009 |

The chromatic number of random graphs for most average degrees A Coja-Oghlan, D Vilenchik International Mathematics Research Notices 2016 (19), 5801-5859, 2016 | 29 | 2016 |

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

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

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

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

Small clique detection and approximate Nash equilibria L Minder, D Vilenchik International Workshop on Approximation Algorithms for Combinatorial …, 2009 | 21 | 2009 |

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 | 21 | 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 | 20 | 2007 |

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

Modeling engagement in self-directed learning systems using principal component analysis H Hershcovits, D Vilenchik, K Gal IEEE Transactions on Learning Technologies 13 (1), 164-171, 2019 | 16 | 2019 |

A greedy anytime algorithm for sparse PCA G Holtzman, A Soffer, D Vilenchik Conference on Learning Theory, 1939-1956, 2020 | 15 | 2020 |

Delaying satisfiability for random 2SAT A Sinclair, D Vilenchik International Workshop on Randomization and Approximation Techniques in …, 2010 | 15 | 2010 |

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