An average-case analysis of the Gaussian algorithm for lattice reduction H Daudé, P Flajolet, B Vallée Combinatorics, Probability and Computing 6 (4), 397-433, 1997 | 82 | 1997 |

An upper bound on the average number of iterations of the LLL algorithm H Daudé, B Vallée Theoretical Computer Science 123 (1), 95-115, 1994 | 76 | 1994 |

Satisfiability threshold for random XOR-CNF formulas N Creignou, H Daude Discrete Applied Mathematics 96, 41-53, 1999 | 74 | 1999 |

Generalized satisfiability problems: minimal elements and phase transitions N Creignou, H Daudé Theoretical Computer Science 302 (1-3), 417-430, 2003 | 50 | 2003 |

Combinatorial sharpness criterion and phase transition classification for random CSPs N Creignou, H Daudé Information and Computation 190 (2), 220-238, 2004 | 39 | 2004 |

Coarse and Sharp Transitions for Random Generalized Satisfyability Problems N Creignou, H Daudé Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and …, 2004 | 36* | 2004 |

Pairs of sat-assignments in random boolean formulæ H Daudé, M Mézard, T Mora, R Zecchina Theoretical Computer Science 393 (1-3), 260-279, 2008 | 34 | 2008 |

Smooth and sharp thresholds for random -XOR-CNF satisfiability N Creignou, H Daudé RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2003 | 31 | 2003 |

The SAT–UNSAT transition for random constraint satisfaction problems N Creignou, H Daudé Discrete mathematics 309 (8), 2085-2099, 2009 | 29 | 2009 |

Approximating the satisfiability threshold for random k-XOR-formulas N Creignou, H Daudé, O Dubois Combinatorics, Probability and Computing 12 (2), 113-126, 2003 | 29 | 2003 |

Random 2 XORSAT phase transition D Hervé, R Vlady Algorithmica 59 (1), 48-65, 2011 | 26 | 2011 |

Phase transition for random quantified XOR-formulas N Creignou, H Daudé, U Egly Journal of Artificial Intelligence Research 29, 1-18, 2007 | 16 | 2007 |

An analysis of the Gaussian algorithm for lattice reduction H Daudé, P Flajolet, B Vallée Algorithmic Number Theory: First International Symposium, ANTS-I Ithaca, NY …, 1994 | 16 | 1994 |

Random 2-XORSAT at the satisfiability threshold H Daudé, V Ravelomanana Latin American Symposium on Theoretical Informatics, 12-23, 2008 | 15 | 2008 |

The MAX-CUT of sparse random graphs H Daudé, C Martínez, V Rasendrahasina, V Ravelomanana Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 12 | 2012 |

New results on the phase transition for random quantified Boolean formulas N Creignou, H Daudé, U Egly, R Rossignol Theory and Applications of Satisfiability Testing–SAT 2008: 11th …, 2008 | 11 | 2008 |

Des factions continues a la reduction des reseaux: analyse en moyenne H Daudé Caen, 1993 | 9 | 1993 |

A sharp threshold for the renameable-Horn and the q-Horn properties N Creignou, H Daudé, J Franco Discrete applied mathematics 153 (1-3), 48-57, 2005 | 8 | 2005 |

(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms N Creignou, H Daudé, U Egly, R Rossignol International Conference on Theory and Applications of Satisfiability …, 2009 | 6 | 2009 |

Sensitivity of Boolean formulas N Creignou, H Daudé European Journal of Combinatorics 34 (5), 793-805, 2013 | 5 | 2013 |