Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan Vilenchik
Person information
- affiliation: Ben-Gurion University, Israel
- affiliation (former): Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Idan Weiss, Dan Vilenchik
:
Predicting Churn in Online Games by Quantifying Diversity of Engagement. Big Data 11(4): 282-295 (2023)- [i15]Yair Neuman, Vladyslav Kozhukhov, Dan Vilenchik:
Data Augmentation for Modeling Human Personality: The Dexter Machine. CoRR abs/2301.08606 (2023) - 2022
- [c20]Ron Korenblum Pick, Vladyslav Kozhukhov, Dan Vilenchik, Oren Tsur:
STEM: Unsupervised STructural EMbedding for Stance Detection. AAAI 2022: 11174-11182 - [c19]Roy Fairstein, Dan Vilenchik, Reshef Meir, Kobi Gal:
Welfare vs. Representation in Participatory Budgeting. AAMAS 2022: 409-417 - [c18]Ilan Tal, Dan Vilenchik:
HARALD: Augmenting Hate Speech Data Sets with Real Data. EMNLP (Findings) 2022: 2241-2248 - [c17]Kiril Danilchenko, Michael Segal, Dan Vilenchik:
Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms. ICWSM 2022: 125-134 - [i14]Roy Fairstein, Reshef Meir, Dan Vilenchik, Kobi Gal:
Welfare vs. Representation in Participatory Budgeting. CoRR abs/2201.07546 (2022) - [i13]Kiril Danilchenko, Michael Segal, Dan Vilenchik:
Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms. CoRR abs/2205.13422 (2022) - [i12]Michael Sidorov, Dan Vilenchik:
Revisiting Information Cascades in Online Social Networks. CoRR abs/2208.00904 (2022) - 2021
- [i11]Ron Korenblum Pick, Vladyslav Kozhukhov, Dan Vilenchik, Oren Tsur:
STEM: Unsupervised STructural EMbedding for Stance Detection. CoRR abs/2112.00712 (2021) - 2020
- [j15]Dan Vilenchik:
Simple Statistics Are Sometime Too Simple: A Case Study in Social Media Data. IEEE Trans. Knowl. Data Eng. 32(2): 402-408 (2020) - [j14]Haviv Hershcovits, Dan Vilenchik, Kobi Gal:
Modeling Engagement in Self-Directed Learning Systems Using Principal Component Analysis. IEEE Trans. Learn. Technol. 13(1): 164-171 (2020) - [c16]Guy Holtzman, Adam Soffer, Dan Vilenchik:
A Greedy Anytime Algorithm for Sparse PCA. COLT 2020: 1939-1956
2010 – 2019
- 2019
- [j13]Yair Neuman, Dan Vilenchik:
Modeling Small Systems Through the Relative Entropy Lattice. IEEE Access 7: 43591-43597 (2019) - [c15]Dan Vilenchik, Barak Yichye, Maor Abutbul:
To Interpret or Not to Interpret PCA? This Is Our Question. ICWSM 2019: 655-658 - [i10]Guy Holtzman, Adam Soffer, Dan Vilenchik:
A greedy anytime algorithm for sparse PCA. CoRR abs/1910.06846 (2019) - 2018
- [j12]Yair Neuman, Navot Israeli, Dan Vilenchik, Yochai Cohen:
The Adaptive Behavior of a Soccer Team: An Entropy-Based Analysis. Entropy 20(10): 758 (2018) - [c14]Yoram Segal, Dan Vilenchik, Ofer Hadar:
Detecting and Coloring Anomalies in Real Cellular Network Using Principle Component Analysis. CSCML 2018: 68-83 - [c13]Dan Vilenchik:
The Million Tweets Fallacy: Activity and Feedback Are Uncorrelated. ICWSM 2018: 688-691 - 2014
- [c12]Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik:
The Condensation Phase Transition in Random Graph Coloring. APPROX-RANDOM 2014: 449-464 - [i9]Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik:
The condensation phase transition in random graph coloring. CoRR abs/1404.5513 (2014) - 2013
- [j11]Igor Pak, Dan Vilenchik:
Constructing Uniquely Realizable Graphs. Discret. Comput. Geom. 50(4): 1051-1071 (2013) - [j10]Alistair Sinclair, Dan Vilenchik:
Delaying satisfiability for random 2SAT. Random Struct. Algorithms 43(2): 251-263 (2013) - [j9]Uriel Feige, Elchanan Mossel, Dan Vilenchik:
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. Theory Comput. 9: 617-651 (2013) - [c11]Amin Coja-Oghlan, Dan Vilenchik:
Chasing the K-Colorability Threshold. FOCS 2013: 380-389 - [c10]Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik:
How Hard Is Counting Triangles in the Streaming Model? ICALP (1) 2013: 244-254 - [c9]Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros:
Zero vs. ε error in interference channels. ITW 2013: 1-5 - [i8]Amin Coja-Oghlan, Dan Vilenchik:
Chasing the k-colorability threshold. CoRR abs/1304.1063 (2013) - [i7]Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik:
How Hard is Counting Triangles in the Streaming Model. CoRR abs/1304.1458 (2013) - [i6]Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros:
Zero vs. epsilon Error in Interference Channels. CoRR abs/1307.6779 (2013) - 2012
- [j8]Choongbum Lee, Benny Sudakov, Dan Vilenchik:
Getting a Directed Hamilton Cycle Two Times Faster. Comb. Probab. Comput. 21(5): 773-801 (2012) - [i5]Michael Langberg, Dan Vilenchik:
Edge distribution in generalized graph products. CoRR abs/1211.1467 (2012) - 2011
- [j7]Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik:
Smoothed analysis of balancing networks. Random Struct. Algorithms 39(1): 115-138 (2011) - [j6]Uriel Feige, Abraham D. Flaxman, Dan Vilenchik:
On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas. SIAM J. Discret. Math. 25(2): 736-749 (2011) - 2010
- [j5]Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik:
Why Almost All k-Colorable Graphs Are Easy to Color. Theory Comput. Syst. 46(3): 523-565 (2010) - [c8]Alistair Sinclair, Dan Vilenchik:
Delaying Satisfiability for Random 2SAT. APPROX-RANDOM 2010: 710-723 - [i4]Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik:
Smoothed Analysis of Balancing Networks. CoRR abs/1006.1443 (2010)
2000 – 2009
- 2009
- [j4]Michael Krivelevich, Benny Sudakov, Dan Vilenchik:
On the Random Satisfiable Process. Comb. Probab. Comput. 18(5): 775-801 (2009) - [j3]Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik:
A Spectral Approach to Analysing Belief Propagation for 3-Colouring. Comb. Probab. Comput. 18(6): 881-912 (2009) - [c7]Lorenz Minder, Dan Vilenchik:
Small Clique Detection and Approximate Nash Equilibria. APPROX-RANDOM 2009: 673-685 - [c6]Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik:
Smoothed Analysis of Balancing Networks. ICALP (2) 2009: 472-483 - [c5]Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik:
On smoothed k-CNF formulas and the Walksat algorithm. SODA 2009: 451-460 - 2008
- [b1]Dan Vilenchik:
A rigorous study of some satisfiability problems. Tel Aviv University, Israel, 2008 - [j2]Julia Böttcher, Dan Vilenchik:
On the tractability of coloring semirandom graphs. Inf. Process. Lett. 108(3): 143-149 (2008) - [i3]Michael Krivelevich, Benny Sudakov, Dan Vilenchik:
On the random satisfiable process. CoRR abs/0807.4326 (2008) - 2007
- [j1]Dan Vilenchik:
It's All about the Support: A New Perspective on the Satisfiability Problem. J. Satisf. Boolean Model. Comput. 3(3-4): 125-139 (2007) - [c4]Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik:
Why Almost All k -Colorable Graphs Are Easy. STACS 2007: 121-132 - [i2]Sonny Ben-Shimon, Dan Vilenchik:
Message passing for the coloring problem: Gallager meets Alon and Kahale. CoRR abs/0710.3928 (2007) - [i1]Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik:
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring. CoRR abs/0712.0171 (2007) - 2006
- [c3]Michael Krivelevich, Dan Vilenchik:
Semirandom Models as Benchmarks for Coloring Algorithms. ANALCO 2006: 211-221 - [c2]Uriel Feige, Elchanan Mossel, Dan Vilenchik:
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. APPROX-RANDOM 2006: 339-350 - [c1]Michael Krivelevich, Dan Vilenchik:
Solving random satisfiable 3CNF formulas in expected polynomial time. SODA 2006: 454-463
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
