Author

Arnaud Durand

Observed names: A Durand, A. Durand, Durand, Arnaud

Institutions: Centre National de la Recherche Scientifique, Université Paris Cité, Université Paris-Saclay, Institut de Mathématiques de Jussieu-Paris Rive Gauche, Laboratoire de Mathématiques d'Orsay, Sorbonne Université

Observed institutions: Université Paris-Sud, École Normale Supérieure Paris-Saclay, Centre National de la Recherche Scientifique, Université Paris-Est Créteil, Université Paris Cité, Université Paris-Saclay, Institut de Mathématiques de Jussieu-Paris Rive Gauche, Laboratoire de Mathématiques d'Orsay, Sorbonne Université, Laboratoire Spécification et Vérification, Lamsade, GREYC, Université Paris Diderot, Laboratoire d'Algorithmique, Complexité et Logique, Université de Caen Normandie

ORCID: 0000-0003-2976-7259

Observed ORCIDs: 0000-0003-2976-7259, 0000-0002-7629-2121

OpenAlex ID: A5059509786

On Acyclic Conjunctive Queries and Constant Delay Enumeration

2007 · Guillaume Bagan, Arnaud Durand, et al. · Lecture notes in computer science · 175

First-order queries on structures of bounded degree are computable with constant delay

2007 · Arnaud Durand, Etienne Grandjean · ACM Transactions on Computational Logic · 88

PDF

Subtractive reductions and complete problems for counting complexity classes

2000 · Arnaud Durand, Miki Hermann, et al. · Mathematical Foundations of Computer Science · 76

Subtractive Reductions and Complete Problems for Counting Complexity Classes

2000 · Arnaud Durand, Miki Hermann, et al. · Lecture notes in computer science · 65

PDF

Approximation and Dependence via Multiteam Semantics

2016 · Arnaud Durand, Miika Hannula, et al. · Annals of Mathematics and Artificial Intelligence · 56

PDF

Structural Tractability of Counting of Solutions to Conjunctive Queries

2014 · Arnaud Durand, Stefan Mengel · Theory of Computing Systems · 53

PDF

Hierarchies in Dependence Logic

2012 · Arnaud Durand, Juha Kontinen · ACM Transactions on Computational Logic · 41

PDF

Probabilistic Team Semantics

2018 · Arnaud Durand, Miika Hannula, et al. · Lecture notes in computer science · 39

PDF

Enumerating answers to first-order queries over databases of low degree

2014 · Arnaud Durand, Nicole Schweikardt, et al. · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · 30

Computing the j th solution of a first-order query

2008 · Guillaume Bagan, Arnaud Durand, et al. · RAIRO - Theoretical Informatics and Applications · 28

Subclasses of binary NP

1998 · A Durand · Journal of Logic and Computation · 27

Fifty years of the spectrum problem: survey and new results

2012 · Arnaud Durand, Neil D. Jones, et al. · Bulletin of Symbolic Logic · 25

PDF

Enumeration Complexity of Logical Query Problems with Second-order Variables

2011 · Durand, Arnaud, Strozecki, Yann · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 21

PDF

Expressivity and Complexity of Dependence Logic

2016 · Arnaud Durand, Juha Kontinen, et al. · Springer eBooks · 20

The complexity of weighted counting for acyclic conjunctive queries

2013 · Arnaud Durand, Stefan Mengel · Journal of Computer and System Sciences · 19

PDF

Spectra with only unary function symbols

1998 · Arnaud Durand, Ronald Fagin, et al. · Lecture notes in computer science · 19

The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete

2003 · Arnaud Durand, Miki Hermann · Lecture notes in computer science · 18

On the counting complexity of propositional circumscription

2007 · Arnaud Durand, Miki Hermann · Information Processing Letters · 15

Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration

2020 · Arnaud Durand · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · 13

Structural tractability of counting of solutions to conjunctive queries

2013 · Arnaud Durand, Stefan Mengel · International Conference on Database Theory · 12

Efficient Enumeration for Conjunctive Queries over X-underbar Structures

2010 · Guillaume Bagan, Arnaud Durand, et al. · Lecture notes in computer science · 11

A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations

2023 · Olivier Bournez, Arnaud Durand · Computational Complexity · 10

PDF

Homomorphism Polynomials Complete for VP

2014 · Durand, Arnaud, Mahajan, Meena, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 10

PDF

Tractability Frontier of Data Complexity in Team Semantics

2021 · Arnaud Durand, Juha Kontinen, et al. · ACM Transactions on Computational Logic · 9

The Arithmetic Complexity of Tensor Contraction

2015 · Florent Capelli, Arnaud Durand, et al. · Theory of Computing Systems · 9

PDF

Works count: 83

Citation count: 1,046

H-index: 17

I10-index: 23