Dan Vilenchik

Available identifiers

zbMath Open vilenchik.danWikidataQ103404569 ScholiaQ103404569MaRDI QIDQ248242

List of research outcomes

Publication	Date of Publication	Type
Semirandom Models as Benchmarks for Coloring Algorithms	2019-09-16	Paper
https://portal.mardi4nfdi.de/entity/Q4633854	2019-05-06	Paper
The Chromatic Number of Random Graphs for Most Average Degrees	2018-12-12	Paper
Constructing cospectral graphs via a new form of graph product	2018-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q2969638	2017-03-22	Paper
The condensation phase transition in random graph coloring	2016-02-23	Paper
Do semidefinite relaxations solve sparse PCA up to the information limit?	2015-07-06	Paper
https://portal.mardi4nfdi.de/entity/Q3191589	2014-10-06	Paper
Constructing uniquely realizable graphs	2014-01-24	Paper
Delaying satisfiability for random 2SAT	2013-10-09	Paper
How Hard Is Counting Triangles in the Streaming Model?	2013-08-06	Paper
Chasing the k-colorability threshold	2013-04-03	Paper
Edge distribution in generalized graph products	2012-11-07	Paper
Getting a Directed Hamilton Cycle Two Times Faster	2012-09-12	Paper
On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas	2011-10-27	Paper
Smoothed analysis of balancing networks	2011-08-09	Paper
Delaying Satisfiability for Random 2SAT	2010-09-10	Paper
Solving random satisfiable 3CNF formulas in expected polynomial time	2010-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q3576756	2010-08-02	Paper
Message passing for the coloring problem: Gallager meets Alon and Kahale	2010-08-02	Paper
On the tractability of coloring semirandom graphs	2010-06-09	Paper
Why almost all \(k\)-colorable graphs are easy to color	2010-05-05	Paper
A Spectral Approach to Analysing Belief Propagation for 3-Colouring	2010-04-23	Paper
On the Random Satisfiable Process	2010-04-22	Paper
Small Clique Detection and Approximate Nash Equilibria	2009-10-28	Paper
Smoothed analysis of balancing networks	2009-07-14	Paper
https://portal.mardi4nfdi.de/entity/Q3506044	2008-06-11	Paper
Why Almost All k-Colorable Graphs Are Easy	2007-09-03	Paper
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems	2007-08-28	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Dan Vilenchik