Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Dan Vilenchik
Observed names:
D. Vilenchik,
DAN VILENCHIK,
Danny Vilenchik,
Vilenchik Dan,
Vilenchik, Dan
Institution:
Ben-Gurion University of the Negev
Observed institutions:
Ben-Gurion University of the Negev,
University of California, Los Angeles,
Tel Aviv University,
Open University of Israel,
Weizmann Institute of Science,
University of California, Berkeley
show all 6
ORCID:
0000-0002-3895-688X
Observed ORCID:
0000-0002-3895-688X
OpenAlex ID:
A5067064621
Do semidefinite relaxations solve sparse PCA up to the information limit?
2015
·
Robert Krauthgamer
, Boaz Nadler
, et al.
·
The Annals of Statistics
·
104
PDF
How Hard Is Counting Triangles in the Streaming Model?
2013
·
Vladimir Braverman
, Rafail Ostrovsky
, et al.
·
Lecture notes in computer science
·
72
PDF
Chasing the K-Colorability Threshold
2013
·
Amin Coja-Oghlan
, Dan Vilenchik
·
Annual Symposium on Foundations of Computer Science
·
66
PDF
The Adaptive Behavior of a Soccer Team: An Entropy-Based Analysis
2018
·
Yair Neuman
, Navot Israeli
, et al.
·
Entropy
·
43
PDF
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
2006
·
Uriel Feige
, Elchanan Mossel
, et al.
·
Lecture notes in computer science
·
43
PDF
Solving random satisfiable 3CNF formulas in expected polynomial time
2006
·
Michael Krivelevich
, Dan Vilenchik
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
42
Solving random satisfiable 3CNF formulas in expected polynomial time
2006
·
Michael Krivelevich
, Dan Vilenchik
·
Symposium on Discrete Algorithms
·
34
The Chromatic Number of Random Graphs for Most Average Degrees
2015
·
Amin Coja-Oghlan
, Dan Vilenchik
·
International Mathematics Research Notices
·
31
PDF
STEM: Unsupervised STructural EMbedding for Stance Detection
2022
·
Ron Korenblum Pick
, Vladyslav Kozhukhov
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
27
Modeling Engagement in Self-Directed Learning Systems Using Principal Component Analysis
2019
·
Haviv Hershcovits
, Dan Vilenchik
, et al.
·
IEEE Transactions on Learning Technologies
·
27
Welfare vs. Representation in Participatory Budgeting
2022
·
Roy Fairstein
, Dan Vilenchik
, et al.
·
Adaptive Agents and Multi-Agents Systems
·
26
PDF
Semirandom Models as Benchmarks for Coloring Algorithms
2006
·
Michael Krivelevich
, Dan Vilenchik
·
Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
·
26
Small Clique Detection and Approximate Nash Equilibria
2009
·
Lorenz Minder
, Dan Vilenchik
·
Lecture notes in computer science
·
24
Discovery of small-molecule inhibitors targeting the ribosomal peptidyl transferase center (PTC) of M. tuberculosis
2019
·
Benjamin Tam
, Dror Sherf
, et al.
·
Chemical Science
·
23
PDF
Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms
2022
·
Kiril Danilchenko
, Michael Segal
, et al.
·
Proceedings of the International AAAI Conference on Web and Social Media
·
21
PDF
Method Matters: Enhancing Voice‐Based Depression Detection With a New Data Collection Framework
2025
·
Dan Vilenchik
, Julie Cwikel
, et al.
·
Depression and Anxiety
·
19
PDF
Do Semidefinite Relaxations Really Solve Sparse PCA
2013
·
Robert Krauthgamer
, Boaz Nadler
, et al.
·
arXiv (Cornell University)
·
19
On smoothed k -CNF formulas and the Walksat algorithm
2009
·
Amin Coja-Oghlan
, Uriel Feige
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
19
On smoothed k-CNF formulas and the Walksat algorithm
2009
·
Amin Coja-Oghlan
, Uriel Feige
, et al.
·
University of Warwick
·
18
Using AI for Dialoguing with Texts: From Psychology to Cinema and Literature
2022
·
Yair Neuman
, Marcel Danesi
, et al.
·
Routledge eBooks
·
16
Why almost all satisfiable $k$-CNF formulas are easy
2007
·
Amin Coja-Oghlan
, Michael Krivelevich
, et al.
·
Discrete Mathematics & Theoretical Computer Science
·
16
To Interpret or Not to Interpret PCA? This Is Our Question
2019
·
Dan Vilenchik
, Barak Yichye
, et al.
·
Proceedings of the International AAAI Conference on Web and Social Media
·
15
PDF
Modeling Small Systems Through the Relative Entropy Lattice
2019
·
Yair Neuman
, Dan Vilenchik
·
IEEE Access
·
13
An Oblivious Approach to Machine Translation Quality Estimation
2021
·
Itamar Elmakias
, Dan Vilenchik
·
Mathematics
·
12
PDF
Why Almost All k-Colorable Graphs Are Easy to Color
2009
·
Amin Coja-Oghlan
, Michael Krivelevich
, et al.
·
Theory of Computing Systems
·
12
Show more works
View as search
Works count:
87
Citation count:
997
H-index:
18
I10-index:
32
Year
Topic
Type