Dan Vilenchik - RankMe

61 papers A* 6A 6B 2Journal 37Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Choosing the right dataset: Hardness criteria for feature selection benchmarking. Knowl. Based Syst. Itamar Elmakias, Dan Vilenchik
2026	J	`jnl`	Concept learning for algorithmic reasoning: Insights from SAT-solving GNNs. Inf. Sci. Elad Shoham, Hadar Cohen, Khalil Wattad, Havana Rika, Dan Vilenchik
2026	A*	`conf`	Learning to Rank: How GNNs Solve Max-Clique and Sparse PCA. AAAI Elad Shoham, Omri Haber, Havana Rika, Dan Vilenchik
2025	B	`conf`	Acquired TASTE: Multimodal Stance Detection with Textual and Structural Embeddings. COLING Guy Barel, Oren Tsur, Dan Vilenchik
2025	A	`conf`	Beyond the Echo Chamber: Modelling Open-Mindedness in Citizens' Assemblies. AAMAS Jake Barrett, Kobi Gal, Loizos Michael, Dan Vilenchik
2024	J	`jnl`	Acquired TASTE: Multimodal Stance Detection with Textual and Structural Embeddings. CoRR Guy Barel, Oren Tsur, Dan Vilenchik
2024	J	`jnl`	Beyond the echo chamber: modelling open-mindedness in citizens' assemblies. Auton. Agents Multi Agent Syst. Jake Barrett, Kobi Gal, Loizos Michael, Dan Vilenchik
2024	J	`jnl`	Concept Learning in the Wild: Towards Algorithmic Understanding of Neural Networks. CoRR Elad Shoham, Hadar Cohen, Khalil Wattad, Havana Rika, Dan Vilenchik
2024	J	`jnl`	Learning Aggregation Rules in Participatory Budgeting: A Data-Driven Approach. CoRR Roy Fairstein, Dan Vilenchik, Kobi Gal
2023	J	`jnl`	Data Augmentation for Modeling Human Personality: The Dexter Machine. CoRR Yair Neuman, Vladyslav Kozhukhov, Dan Vilenchik
2023	J	`jnl`	Predicting Churn in Online Games by Quantifying Diversity of Engagement. Big Data Idan Weiss, Dan Vilenchik
2022	—	`conf`	HARALD: Augmenting Hate Speech Data Sets with Real Data. EMNLP (Findings) Ilan Tal, Dan Vilenchik
2022	A	`conf`	Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms. ICWSM Kiril Danilchenko, Michael Segal, Dan Vilenchik
2022	J	`jnl`	Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms. CoRR Kiril Danilchenko, Michael Segal, Dan Vilenchik
2022	J	`jnl`	Revisiting Information Cascades in Online Social Networks. CoRR Michael Sidorov, Dan Vilenchik
2022	A*	`conf`	STEM: Unsupervised STructural EMbedding for Stance Detection. AAAI Ron Korenblum Pick, Vladyslav Kozhukhov, Dan Vilenchik, Oren Tsur
2022	A	`conf`	Welfare vs. Representation in Participatory Budgeting. AAMAS Roy Fairstein, Dan Vilenchik, Reshef Meir, Kobi Gal
2022	J	`jnl`	Welfare vs. Representation in Participatory Budgeting. CoRR Roy Fairstein, Reshef Meir, Dan Vilenchik, Kobi Gal
2021	J	`jnl`	STEM: Unsupervised STructural EMbedding for Stance Detection. CoRR Ron Korenblum Pick, Vladyslav Kozhukhov, Dan Vilenchik, Oren Tsur
2020	A*	`conf`	A Greedy Anytime Algorithm for Sparse PCA. COLT Guy Holtzman, Adam Soffer, Dan Vilenchik
2020	J	`jnl`	Modeling Engagement in Self-Directed Learning Systems Using Principal Component Analysis. IEEE Trans. Learn. Technol. Haviv Hershcovits, Dan Vilenchik, Kobi Gal
2020	J	`jnl`	Simple Statistics Are Sometime Too Simple: A Case Study in Social Media Data. IEEE Trans. Knowl. Data Eng. Dan Vilenchik
2019	J	`jnl`	A greedy anytime algorithm for sparse PCA. CoRR Guy Holtzman, Adam Soffer, Dan Vilenchik
2019	J	`jnl`	Modeling Small Systems Through the Relative Entropy Lattice. IEEE Access Yair Neuman, Dan Vilenchik
2019	A	`conf`	To Interpret or Not to Interpret PCA? This Is Our Question. ICWSM Dan Vilenchik, Barak Yichye, Maor Abutbul
2018	—	`conf`	Detecting and Coloring Anomalies in Real Cellular Network Using Principle Component Analysis. CSCML Yoram Segal, Dan Vilenchik, Ofer Hadar
2018	J	`jnl`	The Adaptive Behavior of a Soccer Team: An Entropy-Based Analysis. Entropy Yair Neuman, Navot Israeli, Dan Vilenchik, Yochai Cohen
2018	A	`conf`	The Million Tweets Fallacy: Activity and Feedback Are Uncorrelated. ICWSM Dan Vilenchik
2014	—	`conf`	The Condensation Phase Transition in Random Graph Coloring. APPROX-RANDOM Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik
2014	J	`jnl`	The condensation phase transition in random graph coloring. CoRR Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik
2013	A*	`conf`	Chasing the K-Colorability Threshold. FOCS Amin Coja-Oghlan, Dan Vilenchik
2013	J	`jnl`	Chasing the k-colorability threshold CoRR Amin Coja-Oghlan, Dan Vilenchik
2013	J	`jnl`	Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. Theory Comput. Uriel Feige, Elchanan Mossel, Dan Vilenchik
2013	J	`jnl`	Constructing Uniquely Realizable Graphs. Discret. Comput. Geom. Igor Pak, Dan Vilenchik
2013	J	`jnl`	Delaying satisfiability for random 2SAT. Random Struct. Algorithms Alistair Sinclair, Dan Vilenchik
2013	—	`conf`	How Hard Is Counting Triangles in the Streaming Model? ICALP (1) Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik
2013	J	`jnl`	How Hard is Counting Triangles in the Streaming Model CoRR Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik
2013	J	`jnl`	Zero vs. epsilon Error in Interference Channels. CoRR Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros
2013	B	`conf`	Zero vs. ε error in interference channels. ITW Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros
2012	J	`jnl`	Edge distribution in generalized graph products CoRR Michael Langberg, Dan Vilenchik
2012	J	`jnl`	Getting a Directed Hamilton Cycle Two Times Faster. Comb. Probab. Comput. Choongbum Lee, Benny Sudakov, Dan Vilenchik
2011	J	`jnl`	On the Diameter of the Set of Satisfying Assignments in Random Satisfiable SIAM J. Discret. Math. Uriel Feige, Abraham D. Flaxman, Dan Vilenchik
2011	J	`jnl`	Smoothed analysis of balancing networks. Random Struct. Algorithms Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
2010	—	`conf`	Delaying Satisfiability for Random 2SAT. APPROX-RANDOM Alistair Sinclair, Dan Vilenchik
2010	J	`jnl`	Smoothed Analysis of Balancing Networks CoRR Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
2010	J	`jnl`	Why Almost All Theory Comput. Syst. Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
2009	J	`jnl`	A Spectral Approach to Analysing Belief Propagation for 3-Colouring. Comb. Probab. Comput. Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik
2009	A*	`conf`	On smoothed SODA Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik
2009	J	`jnl`	On the Random Satisfiable Process. Comb. Probab. Comput. Michael Krivelevich, Benny Sudakov, Dan Vilenchik
2009	—	`conf`	Small Clique Detection and Approximate Nash Equilibria. APPROX-RANDOM Lorenz Minder, Dan Vilenchik
2009	—	`conf`	Smoothed Analysis of Balancing Networks. ICALP (2) Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
2008	—	`—`	A rigorous study of some satisfiability problems Dan Vilenchik
2008	J	`jnl`	On the random satisfiable process CoRR Michael Krivelevich, Benny Sudakov, Dan Vilenchik
2008	J	`jnl`	On the tractability of coloring semirandom graphs. Inf. Process. Lett. Julia Böttcher, Dan Vilenchik
2007	J	`jnl`	A Spectral Approach to Analyzing Belief Propagation for 3-Coloring CoRR Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik
2007	J	`jnl`	It's All about the Support: A New Perspective on the Satisfiability Problem. J. Satisf. Boolean Model. Comput. Dan Vilenchik
2007	J	`jnl`	Message passing for the coloring problem: Gallager meets Alon and Kahale. CoRR Sonny Ben-Shimon, Dan Vilenchik
2007	A	`conf`	Why Almost All STACS Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
2006	—	`conf`	Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. APPROX-RANDOM Uriel Feige, Elchanan Mossel, Dan Vilenchik
2006	—	`conf`	Semirandom Models as Benchmarks for Coloring Algorithms. ANALCO Michael Krivelevich, Dan Vilenchik
2006	A*	`conf`	Solving random satisfiable 3CNF formulas in expected polynomial time. SODA Michael Krivelevich, Dan Vilenchik