Arnaud Durand

1.3k total citations
54 papers, 443 citations indexed

About

Arnaud Durand is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Mathematical Physics. According to data from OpenAlex, Arnaud Durand has authored 54 papers receiving a total of 443 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 22 papers in Artificial Intelligence and 8 papers in Mathematical Physics. Recurrent topics in Arnaud Durand's work include Complexity and Algorithms in Graphs (11 papers), Advanced Graph Theory Research (9 papers) and Computability, Logic, AI Algorithms (9 papers). Arnaud Durand is often cited by papers focused on Complexity and Algorithms in Graphs (11 papers), Advanced Graph Theory Research (9 papers) and Computability, Logic, AI Algorithms (9 papers). Arnaud Durand collaborates with scholars based in France, Germany and Switzerland. Arnaud Durand's co-authors include Ery Arias-Castro, Emmanuel J. Candès, Jacques Pasquier, Miki Hermann, Étienne Grandjean, Phokion G. Kolaitis, Juha Kontinen, Stéphane Jaffard, Christian Prins and Andréa Cynthia Santos and has published in prestigious journals such as SHILAP Revista de lepidopterología, The Annals of Statistics and Communications in Mathematical Physics.

In The Last Decade

Arnaud Durand

51 papers receiving 427 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Arnaud Durand France 12 159 126 125 63 49 54 443
Chin-Tzong Pang Taiwan 12 89 0.6× 159 1.3× 33 0.3× 29 0.5× 26 0.5× 45 332
Aravindan Vijayaraghavan United States 8 140 0.9× 182 1.4× 82 0.7× 5 0.1× 23 0.5× 28 340
Baoguo Jia China 19 93 0.6× 120 1.0× 92 0.7× 83 1.3× 11 0.2× 81 1.2k
Shoumei Li China 17 193 1.2× 157 1.2× 26 0.2× 29 0.5× 14 0.3× 52 632
Michael Soltys United States 10 90 0.6× 100 0.8× 55 0.4× 6 0.1× 61 1.2× 31 334
Marvin K. Nakayama United States 17 78 0.5× 99 0.8× 94 0.8× 54 0.9× 12 0.2× 101 929
Zhenyuan Wang United States 10 160 1.0× 141 1.1× 14 0.1× 65 1.0× 18 0.4× 25 664
Philippe Chassaing France 11 65 0.4× 56 0.4× 68 0.5× 211 3.3× 4 0.1× 28 348
Антон Илиев Bulgaria 9 62 0.4× 77 0.6× 25 0.2× 18 0.3× 19 0.4× 83 395
Johannes Grabmeier Germany 8 205 1.3× 157 1.2× 28 0.2× 16 0.3× 102 2.1× 13 401

Countries citing papers authored by Arnaud Durand

Since Specialization
Citations

This map shows the geographic impact of Arnaud Durand'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 Arnaud Durand with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arnaud Durand more than expected).

Fields of papers citing papers by Arnaud Durand

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Arnaud Durand. 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 Arnaud Durand. The network helps show where Arnaud Durand may publish in the future.

Co-authorship network of co-authors of Arnaud Durand

This figure shows the co-authorship network connecting the top 25 collaborators of Arnaud Durand. A scholar is included among the top collaborators of Arnaud Durand 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 Arnaud Durand. Arnaud Durand is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Durand, Arnaud, et al.. (2017). Decentralized web of trust and authentication for the internet of things. 1–2. 16 indexed citations
2.
Durand, Arnaud, et al.. (2016). Descriptive Complexity of #AC^0 Functions. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
3.
Durand, Arnaud, et al.. (2015). Dependence Logic with a Majority Quantifier. Journal of Logic Language and Information. 24(3). 289–305.
4.
5.
Durand, Arnaud, et al.. (2015). Tractability Frontier of Data Complexity in Team Semantics. SHILAP Revista de lepidopterología. 193. 73–85. 1 indexed citations
6.
Durand, Arnaud. (2015). Describability via ubiquity and eutaxy in Diophantine approximation. Annales mathématiques Blaise Pascal. 22(S2). 1–149. 5 indexed citations
7.
Durand, Arnaud, et al.. (2013). The complexity of weighted counting for acyclic conjunctive queries. Journal of Computer and System Sciences. 80(1). 277–296. 6 indexed citations
8.
Durand, Arnaud, et al.. (2013). Structural tractability of counting of solutions to conjunctive queries. 81–92. 5 indexed citations
9.
Durand, Arnaud, et al.. (2013). The arithmetic complexity of tensor contractions. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 376. 1 indexed citations
10.
Durand, Arnaud & Stéphane Jaffard. (2011). Multifractal analysis of Lévy fields. Probability Theory and Related Fields. 153(1-2). 45–96. 10 indexed citations
11.
Arias-Castro, Ery, Emmanuel J. Candès, & Arnaud Durand. (2010). Detection of an anomalous cluster in a network. The Annals of Statistics. 39(1). 89 indexed citations
12.
Durand, Arnaud & Michel Habib. (2010). Complexity issues for the sandwich homogeneous set problem. Discrete Applied Mathematics. 159(7). 574–580. 1 indexed citations
13.
Durand, Arnaud. (2009). Large intersection properties in Diophantine approximation and dynamical systems. Journal of the London Mathematical Society. 79(2). 377–398. 8 indexed citations
14.
Durand, Arnaud. (2008). Sets with large intersection and ubiquity. Mathematical Proceedings of the Cambridge Philosophical Society. 144(1). 119–144. 24 indexed citations
15.
Durand, Arnaud. (2008). Singularity sets of Lévy processes. Probability Theory and Related Fields. 143(3-4). 517–544. 13 indexed citations
16.
Durand, Arnaud, et al.. (2008). Computing thejth solution of a first-order query. RAIRO - Theoretical Informatics and Applications. 42(1). 147–164. 3 indexed citations
17.
Durand, Arnaud, et al.. (2002). Nonerasing, Counting, and Majority over the Linear Time Hierarchy. Information and Computation. 174(2). 132–142. 6 indexed citations
18.
Durand, Arnaud. (2002). Linear Time and the Power of One First-Order Universal Quantifier. Information and Computation. 178(1). 12–22. 1 indexed citations
19.
Durand, Arnaud, Miki Hermann, & Phokion G. Kolaitis. (2000). Subtractive reductions and complete problems for counting complexity classes. 340(3). 323–332. 36 indexed citations
20.
Durand, Arnaud, et al.. (1996). First-order spectra with one binary predicate. Theoretical Computer Science. 160(1-2). 305–320. 4 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

Rankless by CCL
2026