Hervé Daudé

452 total citations
13 papers, 172 citations indexed

About

Hervé Daudé is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Hervé Daudé has authored 13 papers receiving a total of 172 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 9 papers in Computer Networks and Communications and 4 papers in Artificial Intelligence. Recurrent topics in Hervé Daudé's work include Constraint Satisfaction and Optimization (9 papers), Advanced Graph Theory Research (7 papers) and Complexity and Algorithms in Graphs (5 papers). Hervé Daudé is often cited by papers focused on Constraint Satisfaction and Optimization (9 papers), Advanced Graph Theory Research (7 papers) and Complexity and Algorithms in Graphs (5 papers). Hervé Daudé collaborates with scholars based in France, United States and Italy. Hervé Daudé's co-authors include Nadia Creignou, Brigitte Vallée, Philippe Flajolet, Olivier Dubois, Marc Mézard, Thierry Mora, Riccardo Zecchina, John Franco and Conrado Martı́nez and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Hervé Daudé

13 papers receiving 152 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Hervé Daudé France	9	106	98	48	36	21	13	172
C. P. Schnorr Germany	5	73 0.7×	136 1.4×	118 2.5×	18 0.5×	49 2.3×	5	236
Frank R. Bernhart United States	3	43 0.4×	122 1.2×	29 0.6×	10 0.3×	56 2.7×	5	240
Robin A. Moser Switzerland	4	55 0.5×	191 1.9×	78 1.6×	9 0.3×	21 1.0×	5	259
Amir Nayyeri United States	10	92 0.9×	106 1.1×	33 0.7×	13 0.4×	35 1.7×	35	231
Ishay Haviv Israel	7	60 0.6×	99 1.0×	76 1.6×	5 0.1×	24 1.1×	33	167
Isolde Adler Germany	8	87 0.8×	190 1.9×	53 1.1×	26 0.7×	7 0.3×	21	231
Xavier Pérez‐Giménez Canada	8	76 0.7×	63 0.6×	11 0.2×	11 0.3×	16 0.8×	24	142
David A. Grable Germany	10	114 1.1×	169 1.7×	51 1.1×	9 0.3×	46 2.2×	22	254
Jonathan F. Buss Canada	8	98 0.9×	215 2.2×	96 2.0×	7 0.2×	33 1.6×	20	314
Eugene V. Zima Canada	9	40 0.4×	93 0.9×	77 1.6×	6 0.2×	26 1.2×	32	239

Countries citing papers authored by Hervé Daudé

Since Specialization

Citations

This map shows the geographic impact of Hervé Daudé's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hervé Daudé with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hervé Daudé more than expected).

Fields of papers citing papers by Hervé Daudé

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hervé Daudé. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hervé Daudé. The network helps show where Hervé Daudé may publish in the future.

Co-authorship network of co-authors of Hervé Daudé

This figure shows the co-authorship network connecting the top 25 collaborators of Hervé Daudé. A scholar is included among the top collaborators of Hervé Daudé based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Hervé Daudé. Hervé Daudé is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

13 of 13 papers shown

Creignou, Nadia & Hervé Daudé. (2013). Sensitivity of Boolean formulas. European Journal of Combinatorics. 34(5). 793–805. 1 indexed citations

Daudé, Hervé, et al.. (2012). The MAX-CUT of sparse random graphs. 265–271. 4 indexed citations

Daudé, Hervé, Marc Mézard, Thierry Mora, & Riccardo Zecchina. (2008). Pairs of SAT-assignments in random Boolean formulæ. Theoretical Computer Science. 393(1-3). 260–279. 13 indexed citations

Creignou, Nadia & Hervé Daudé. (2008). The SAT–UNSAT transition for random constraint satisfaction problems. Discrete Mathematics. 309(8). 2085–2099. 8 indexed citations

Creignou, Nadia, Hervé Daudé, & Olivier Dubois. (2007). Expected number of locally maximal solutions for random Boolean CSPs. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AH,...(Proceedings). 2 indexed citations

Creignou, Nadia, Hervé Daudé, & John Franco. (2005). A sharp threshold for the renameable-Horn and the q-Horn properties. Discrete Applied Mathematics. 153(1-3). 48–57. 2 indexed citations

Creignou, Nadia & Hervé Daudé. (2004). Combinatorial sharpness criterion and phase transition classification for random CSPs. Information and Computation. 190(2). 220–238. 18 indexed citations

Creignou, Nadia & Hervé Daudé. (2003). Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability. RAIRO - Theoretical Informatics and Applications. 37(2). 127–147. 9 indexed citations

Creignou, Nadia, Hervé Daudé, & Olivier Dubois. (2003). Approximating the Satisfiability Threshold for Random k-XOR-formulas. Combinatorics Probability Computing. 12(2). 113–126. 9 indexed citations

10.

Creignou, Nadia & Hervé Daudé. (2002). Generalized satisfiability problems: minimal elements and phase transitions. Theoretical Computer Science. 302(1-3). 417–430. 24 indexed citations

11.

Creignou, Nadia & Hervé Daudé. (1999). Satisfiability threshold for random XOR-CNF formulas. Discrete Applied Mathematics. 96-97. 41–53. 29 indexed citations

12.

Daudé, Hervé, Philippe Flajolet, & Brigitte Vallée. (1997). An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction. Combinatorics Probability Computing. 6(4). 397–433. 23 indexed citations

13.

Daudé, Hervé & Brigitte Vallée. (1994). An upper bound on the average number of iterations of the LLL algorithm. Theoretical Computer Science. 123(1). 95–115. 30 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact