Hervé Daudé

According to our database1, Hervé Daudé authored at least 21 papers between 1994 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Exact location of the phase transition for random (1, 2)-QSAT.
RAIRO Theor. Informatics Appl., 2015

2013
Sensitivity of Boolean formulas.
Eur. J. Comb., 2013

2012
The MAX-CUT of sparse random graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Random 2 XORSAT Phase Transition.
Algorithmica, 2011

2009
The SAT-UNSAT transition for random constraint satisfaction problems.
Discret. Math., 2009

The threshold for random (1,2)-QSAT
CoRR, 2009

(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008
Pairs of SAT-assignments in random Boolean formulæ.
Theor. Comput. Sci., 2008

New Results on the Phase Transition for Random Quantified Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Random 2-XORSAT at the Satisfiability Threshold.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Phase Transition for Random Quantified XOR-Formulas.
J. Artif. Intell. Res., 2007

2005
A sharp threshold for the renameable-Horn and the q-Horn properties.
Discret. Appl. Math., 2005

Pairs of SAT Assignment in Random Boolean Formulae
CoRR, 2005

2004
Combinatorial sharpness criterion and phase transition classification for random CSPs.
Inf. Comput., 2004

2003
Generalized satisfiability problems: minimal elements and phase transitions.
Theor. Comput. Sci., 2003

Smooth and sharp thresholds for random <i>k</i>-XOR-CNF satisfiability.
RAIRO Theor. Informatics Appl., 2003

Approximating The Satisfiability Threshold For Random K-Xor-Formulas.
Comb. Probab. Comput., 2003

1999
Satisfiability Threshold for Random XOR-CNF Formulas.
Discret. Appl. Math., 1999

1997
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction.
Comb. Probab. Comput., 1997

1994
An Upper Bound on the Average Number of Iterations of the LLL Algorithm.
Theor. Comput. Sci., 1994

An analysis of the Gaussian algorithm for lattice reduction.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994


  Loading...