Dan Vilenchik - Citegraph

Author Info

Name	Affiliation	Papers
DAN VILENCHIK	Weizmann Inst Sci, Dept Comp Sci & Appl Math, IL-76100 Rehovot, Israel	26
Collaborators	Citations	PageRank
28	143	13.36
Referers	Referees	References
214	288	338

Search Limit

100288

Publications (26 rows)

Collaborators (28 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A greedy anytime algorithm for sparse PCA	0	0.34	2020
Simple Statistics Are Sometime Too Simple: A Case Study in Social Media Data	0	0.34	2020
Modeling Small Systems Through the Relative Entropy Lattice.	0	0.34	2019
The Adaptive Behavior of a Soccer Team: An Entropy-Based Analysis.	1	0.36	2018
The Condensation Phase Transition in Random Graph Coloring.	8	0.50	2014
Constructing Uniquely Realizable Graphs.	2	0.39	2013
How hard is counting triangles in the streaming model?	14	0.65	2013
Chasing the K-Colorability Threshold	20	0.86	2013
Zero Vs. Epsilon Error In Interference Channels	0	0.34	2013
Delaying Satisfiability for Random 2SAT	2	0.38	2013
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems	22	1.02	2013
Edge distribution in generalized graph products	0	0.34	2012
Getting a directed hamilton cycle two times faster	2	0.45	2012
On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas.	2	0.36	2011
Smoothed analysis of balancing networks	5	0.46	2011
Why Almost All k-Colorable Graphs Are Easy to Color	6	0.57	2010
On smoothed k-CNF formulas and the Walksat algorithm	8	0.50	2009
On the random satisfiable process	5	0.46	2009
Small Clique Detection and Approximate Nash Equilibria	13	0.67	2009
On the tractability of coloring semirandom graphs	1	0.34	2008
Message passing for the coloring problem: Gallager meets Alon and Kahale	1	0.36	2007
Why almost all k-colorable graphs are easy	5	0.55	2007
It's All about the Support: A New Perspective on the Satisfiability Problem	1	0.39	2007
A spectral approach to analysing belief propagation for 3-colouring	10	0.85	2007
Semirandom Models as Benchmarks for Coloring Algorithms.	0	0.34	2006
Solving random satisfiable 3CNF formulas in expected polynomial time	15	1.19	2006