( en | de | ru )

 

Disambiguation of "Vilenchik, Dan"

Author of the publication

copydeleteadd this publication to your clipboard
Getting a Directed Hamilton Cycle Two Times Faster.

, , and . Comb. Probab. Comput., 21 (5): 773-801 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dan Wang

Dan Tidten

Dan Brüllmann

Dan Bauer

Marius Dan

 

Other publications of authors with the same name

Simple Statistics Are Sometime Too Simple: A Case Study in Social Media Data.. IEEE Trans. Knowl. Data Eng., 32 (2): 402-408 (2020)On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas., , and . SIAM J. Discret. Math., 25 (2): 736-749 (2011)Why Almost All k -Colorable Graphs Are Easy., , and . STACS, volume 4393 of Lecture Notes in Computer Science, page 121-132. Springer, (2007)A Greedy Anytime Algorithm for Sparse PCA., , and . COLT, volume 125 of Proceedings of Machine Learning Research, page 1939-1956. PMLR, (2020)Semirandom Models as Benchmarks for Coloring Algorithms., and . ANALCO, page 211-221. SIAM, (2006)On the tractability of coloring semirandom graphs., and . Inf. Process. Lett., 108 (3): 143-149 (2008)Modeling Small Systems Through the Relative Entropy Lattice., and . IEEE Access, (2019)The Adaptive Behavior of a Soccer Team: An Entropy-Based Analysis., , , and . Entropy, 20 (10): 758 (2018)The Million Tweets Fallacy: Activity and Feedback Are Uncorrelated.. ICWSM, page 688-691. AAAI Press, (2018)Delaying Satisfiability for Random 2SAT., and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 710-723. Springer, (2010)