The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Dan Vilenchik" ( http://dblp.L3S.de/Authors/Dan_Vilenchik )

URL (Homepage):  http://www.cs.tau.ac.il/~vilenchi/  Author page on DBLP  Author page in RDF  Community of Dan Vilenchik in ASPL-2

Publication years (Num. hits)
2006-2010 (17) 2011-2014 (15) 2018-2019 (4)
Publication types (Num. hits)
article(22) inproceedings(14)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 37 publication records. Showing 36 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Yair Neuman, Dan Vilenchik Modeling Small Systems Through the Relative Entropy Lattice. Search on Bibsonomy IEEE Access The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yair Neuman, Navot Israeli, Dan Vilenchik, Yochai Cohen The Adaptive Behavior of a Soccer Team: An Entropy-Based Analysis. Search on Bibsonomy Entropy The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dan Vilenchik The Million Tweets Fallacy: Activity and Feedback Are Uncorrelated. Search on Bibsonomy ICWSM The full citation details ... 2018 DBLP  BibTeX  RDF
1Yoram Segal, Dan Vilenchik, Ofer Hadar Detecting and Coloring Anomalies in Real Cellular Network Using Principle Component Analysis. Search on Bibsonomy CSCML The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik The condensation phase transition in random graph coloring. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik The Condensation Phase Transition in Random Graph Coloring. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Uriel Feige, Elchanan Mossel, Dan Vilenchik Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. Search on Bibsonomy Theory of Computing The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Igor Pak, Dan Vilenchik Constructing Uniquely Realizable Graphs. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Alistair Sinclair, Dan Vilenchik Delaying satisfiability for random 2SAT. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros Zero vs. epsilon Error in Interference Channels. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik How Hard is Counting Triangles in the Streaming Model Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Amin Coja-Oghlan, Dan Vilenchik Chasing the k-colorability threshold Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik How Hard Is Counting Triangles in the Streaming Model? Search on Bibsonomy ICALP (1) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Amin Coja-Oghlan, Dan Vilenchik Chasing the K-Colorability Threshold. Search on Bibsonomy FOCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros Zero vs. ε error in interference channels. Search on Bibsonomy ITW The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michael Langberg, Dan Vilenchik Edge distribution in generalized graph products Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Choongbum Lee, Benny Sudakov, Dan Vilenchik Getting a Directed Hamilton Cycle Two Times Faster. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Thomas Sauerwald, Dan Vilenchik Smoothed analysis of balancing networks. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Uriel Feige, Abraham D. Flaxman, Dan Vilenchik On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik Why Almost All k-Colorable Graphs Are Easy to Color. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Thomas Sauerwald, Dan Vilenchik Smoothed Analysis of Balancing Networks Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Alistair Sinclair, Dan Vilenchik Delaying Satisfiability for Random 2SAT. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Benny Sudakov, Dan Vilenchik On the Random Satisfiable Process. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik A Spectral Approach to Analysing Belief Propagation for 3-Colouring. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Thomas Sauerwald, Dan Vilenchik Smoothed Analysis of Balancing Networks. Search on Bibsonomy ICALP (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik On smoothed k-CNF formulas and the Walksat algorithm. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
1Lorenz Minder, Dan Vilenchik Small Clique Detection and Approximate Nash Equilibria. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Julia Böttcher, Dan Vilenchik On the tractability of coloring semirandom graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Benny Sudakov, Dan Vilenchik On the random satisfiable process Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Dan Vilenchik It's All about the Support: A New Perspective on the Satisfiability Problem. Search on Bibsonomy JSAT The full citation details ... 2007 DBLP  BibTeX  RDF
1Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik A Spectral Approach to Analyzing Belief Propagation for 3-Coloring Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Sonny Ben-Shimon, Dan Vilenchik Message passing for the coloring problem: Gallager meets Alon and Kahale. Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik Why Almost All k -Colorable Graphs Are Easy. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Dan Vilenchik Semirandom Models as Benchmarks for Coloring Algorithms. Search on Bibsonomy ANALCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Dan Vilenchik Solving random satisfiable 3CNF formulas in expected polynomial time. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Uriel Feige, Elchanan Mossel, Dan Vilenchik Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #36 of 36 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license