Hervé Daudé

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The MAX-CUT of sparse random graphs	2019-05-10	Paper
scientific article; zbMATH DE number 6696725 (Why is no real title available?)	2017-03-23	Paper
Exact location of the phase transition for random (1,2)-QSAT RAIRO - Theoretical Informatics and Applications	2015-04-15	Paper
Sensitivity of Boolean formulas European Journal of Combinatorics	2013-03-19	Paper
Expected number of locally maximal solutions for random Boolean CSPs	2010-08-02	Paper
The SAT-UNSAT transition for random constraint satisfaction problems Discrete Mathematics	2009-06-19	Paper
scientific article; zbMATH DE number 5547881 (Why is no real title available?) (available as arXiv preprint)	2009-04-28	Paper
New Results on the Phase Transition for Random Quantified Boolean Formulas Theory and Applications of Satisfiability Testing – SAT 2008	2008-05-27	Paper
Pairs of SAT-assignments in random Boolean formulæ Theoretical Computer Science	2008-04-15	Paper
Random 2-XORSAT at the Satisfiability Threshold Lecture Notes in Computer Science	2008-04-15	Paper
A sharp threshold for the renameable-Horn and the \(q\)-Horn properties Discrete Applied Mathematics	2006-01-10	Paper
scientific article; zbMATH DE number 2127760 (Why is no real title available?)	2005-01-14	Paper
Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability RAIRO - Theoretical Informatics and Applications	2004-10-28	Paper
Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability RAIRO - Theoretical Informatics and Applications	2004-10-28	Paper
Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability RAIRO - Theoretical Informatics and Applications	2004-10-28	Paper
Combinatorial sharpness criterion and phase transition classification for random CSPs Information and Computation	2004-08-06	Paper
Generalized satisfiability problems: Minimal elements and phase transitions. Theoretical Computer Science	2003-08-17	Paper
Approximating the Satisfiability Threshold for Random k-XOR-formulas Combinatorics, Probability and Computing	2003-01-01	Paper
Satisfiability threshold for random XOR-CNF formulas Discrete Applied Mathematics	2000-01-17	Paper
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction Combinatorics, Probability and Computing	1997-12-18	Paper
scientific article; zbMATH DE number 799773 (Why is no real title available?)	1996-07-16	Paper
An upper bound on the average number of iterations of the LLL algorithm Theoretical Computer Science	1994-03-03	Paper

Research outcomes over time

This page was built for person: Hervé Daudé