Dan Vilenchik

According to our database1, Dan Vilenchik authored at least 24 papers between 2006 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Modeling Small Systems Through the Relative Entropy Lattice.
IEEE Access, 2019

The Adaptive Behavior of a Soccer Team: An Entropy-Based Analysis.
Entropy, 2018

The Million Tweets Fallacy: Activity and Feedback Are Uncorrelated.
Proceedings of the Twelfth International Conference on Web and Social Media, 2018

Detecting and Coloring Anomalies in Real Cellular Network Using Principle Component Analysis.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2018

The Condensation Phase Transition in Random Graph Coloring.
Proceedings of the Approximation, 2014

Constructing Uniquely Realizable Graphs.
Discrete & Computational Geometry, 2013

Zero vs. ε error in interference channels.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

How Hard Is Counting Triangles in the Streaming Model?
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Chasing the K-Colorability Threshold.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Getting a Directed Hamilton Cycle Two Times Faster.
Combinatorics, Probability & Computing, 2012

On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas.
SIAM J. Discrete Math., 2011

Why Almost All k-Colorable Graphs Are Easy to Color.
Theory Comput. Syst., 2010

Delaying Satisfiability for Random 2SAT.
Proceedings of the Approximation, 2010

On the Random Satisfiable Process.
Combinatorics, Probability & Computing, 2009

A Spectral Approach to Analysing Belief Propagation for 3-Colouring.
Combinatorics, Probability & Computing, 2009

On smoothed k-CNF formulas and the Walksat algorithm.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Smoothed Analysis of Balancing Networks.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Small Clique Detection and Approximate Nash Equilibria.
Proceedings of the Approximation, 2009

On the tractability of coloring semirandom graphs.
Inf. Process. Lett., 2008

It's All about the Support: A New Perspective on the Satisfiability Problem.
JSAT, 2007

Why Almost All k -Colorable Graphs Are Easy.
Proceedings of the STACS 2007, 2007

Solving random satisfiable 3CNF formulas in expected polynomial time.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems.
Proceedings of the Approximation, 2006

Semirandom Models as Benchmarks for Coloring Algorithms.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006