First-Order Spectra with one Binary Predicate. - Arnaud Durand 001; Solomampionona Ranaivoson (Theor. Comput. Sci., 1996)

Spectra with Only Unary Function Symbols. - Arnaud Durand 001; Ronald Fagin; Bernd Loescher (CSL, 1997)

Modeling Cache Coherence Protocol - A Case Study with FLASH. - Arnaud Durand 001 (Workshop on Abstract State Machines, 1998)

Subclasses of Binary NP. - Arnaud Durand 001; Clemens Lautemann; Thomas Schwentick (J. Log. Comput., 1998)

Linear Time and the Power of One First-Order Universal Quantifier. - Arnaud Durand 001 (Inf. Comput., 2002)

Nonerasing, Counting, and Majority over the Linear Time Hierarchy. - Arnaud Durand 001; Malika More (Inf. Comput., 2002)

On the complexity of recognizing the Hilbert basis of a linear diophantine system. - Arnaud Durand 001; Miki Hermann; Laurent Juban (Theor. Comput. Sci., 2002)

The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. - Arnaud Durand 001; Miki Hermann (STACS, 2003)

Subtractive reductions and complete problems for counting complexity classes. - Arnaud Durand 001; Miki Hermann; Phokion G. Kolaitis (Theor. Comput. Sci., 2005)

First-Order Queries over One Unary Function. - Arnaud Durand 001; Frédéric Olive (CSL, 2006)

Counting Results in Weak Formalisms. - Arnaud Durand 001; Clemens Lautemann; Malika More (Circuits, Logic, and Games, 2006)

The complexity of acyclic conjunctive queries revisited - Arnaud Durand 001; Etienne Grandjean (CoRR, 2006)

The Expressive Power of Bijections over Weakly Arithmetized Structures. - Étienne Ailloud; Arnaud Durand 001 (Theory Comput. Syst., 2006)

On Acyclic Conjunctive Queries and Constant Delay Enumeration. - Guillaume Bagan; Arnaud Durand 001; Etienne Grandjean (CSL, 2007)

A simple proof of the polylog counting ability of first-order logic: guest column. - Arnaud Durand 001; Clemens Lautemann; Malika More (SIGACT News, 2007)

First-order queries on structures of bounded degree are computable with constant delay. - Arnaud Durand 001; Etienne Grandjean (ACM Trans. Comput. Log., 2007)

On the counting complexity of propositional circumscription. - Arnaud Durand 001; Miki Hermann (Inf. Process. Lett., 2008)

Computing the jth solution of a first-order query. - Guillaume Bagan; Arnaud Durand 001; Etienne Grandjean; Frédéric Olive (RAIRO Theor. Informatics Appl., 2008)

Trichotomy in the Complexity of Minimal Inference. - Arnaud Durand 001; Miki Hermann; Gustav Nordh (LICS, 2009)

Efficient Enumeration for Conjunctive Queries over X-underbar Structures. - Guillaume Bagan; Arnaud Durand 001; Emmanuel Filiot; Olivier Gauwin (CSL, 2010)

Enumeration Complexity of Logical Query Problems with Second-order Variables. - Arnaud Durand 001; Yann Strozecki (CSL, 2011)

On Polynomials Defined by Acyclic Conjunctive Queries and Weighted Counting Problems - Arnaud Durand 001; Stefan Mengel (CoRR, 2011)

Complexity issues for the sandwich homogeneous set problem. - Arnaud Durand 001; Michel Habib (Discret. Appl. Math., 2011)

Fifty years of the spectrum problem: survey and new results. - Arnaud Durand 001; Neil D. Jones; Johann A. Makowsky; Malika More (Bull. Symb. Log., 2012)

Trichotomies in the Complexity of Minimal Inference. - Arnaud Durand 001; Miki Hermann; Gustav Nordh (Theory Comput. Syst., 2012)

Hierarchies in Dependence Logic. - Arnaud Durand 001; Juha Kontinen (ACM Trans. Comput. Log., 2012)

The arithmetic complexity of tensor contractions. - Florent Capelli; Arnaud Durand 001; Stefan Mengel (STACS, 2013)

Hypergraph Acyclicity and Propositional Model Counting. - Florent Capelli; Arnaud Durand 001; Stefan Mengel (SAT, 2014)

The complexity of weighted counting for acyclic conjunctive queries. - Arnaud Durand 001; Stefan Mengel (J. Comput. Syst. Sci., 2014)

Tractability Frontier of Data Complexity in Team Semantics. - Arnaud Durand 001; Juha Kontinen; Nicolas de Rugy-Altherre; Jouko Väänänen (GandALF, 2015)

Dependence Logic with a Majority Quantifier. - Arnaud Durand 001; Johannes Ebbing; Juha Kontinen; Heribert Vollmer (J. Log. Lang. Inf., 2015)

Structural Tractability of Counting of Solutions to Conjunctive Queries. - Arnaud Durand 001; Stefan Mengel (Theory Comput. Syst., 2015)

Expressivity and Complexity of Dependence Logic. - Arnaud Durand 001; Juha Kontinen; Heribert Vollmer (Dependence Logic, 2016)

Descriptive Complexity of #AC0 Functions. - Arnaud Durand 001; Anselm Haak; Juha Kontinen; Heribert Vollmer (CSL, 2016)

Homomorphism Polynomials Complete for VP. - Arnaud Durand 001; Meena Mahajan; Guillaume Malod; Nicolas de Rugy-Altherre; Nitin Saurabh (Chic. J. Theor. Comput. Sci., 2016)

The Arithmetic Complexity of Tensor Contraction. - Florent Capelli; Arnaud Durand 001; Stefan Mengel (Theory Comput. Syst., 2016)

Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth. - Arnaud Durand 001; Anselm Haak; Heribert Vollmer (CoRR, 2017)

Probabilistic Team Semantics. - Arnaud Durand 001; Miika Hannula; Juha Kontinen; Arne Meier; Jonni Virtema (FoIKS, 2018)

Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. - Arnaud Durand 001; Anselm Haak; Heribert Vollmer (LICS, 2018)

Approximation and dependence via multiteam semantics. - Arnaud Durand 001; Miika Hannula; Juha Kontinen; Arne Meier; Jonni Virtema (Ann. Math. Artif. Intell., 2018)

Recursion schemes, discrete differential equations and characterization of polynomial time computation. - Olivier Bournez; Arnaud Durand 001; Sabrina Ouazzani (CoRR, 2018)

Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. - Olivier Bournez; Arnaud Durand 001 (MFCS, 2019)

Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration. - Arnaud Durand 001 (PODS, 2020)

Descriptive complexity of #P functions: A new perspective. - Arnaud Durand 001; Anselm Haak; Juha Kontinen; Heribert Vollmer (J. Comput. Syst. Sci., 2021)

Enumeration Classes Defined by Circuits. - Nadia Creignou; Arnaud Durand 001; Heribert Vollmer (MFCS, 2022)

A characterization of functions over the integers computable in polynomial time using discrete differential equations. - Olivier Bournez; Arnaud Durand 001 (CoRR, 2022)

Enumerating Answers to First-Order Queries over Databases of Low Degree. - Arnaud Durand 001; Nicole Schweikardt; Luc Segoufin (Log. Methods Comput. Sci., 2022)

A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations. - Olivier Bournez; Arnaud Durand 001 (Comput. Complex., 2023)

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations (short paper). - Melissa Antonelli; Arnaud Durand 001; Juha Kontinen (ICTCS, 2024)

A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations. - Melissa Antonelli; Arnaud Durand 001; Juha Kontinen (MFCS, 2024)

Modular SAT-based techniques for reasoning tasks in team semantics. - Arnaud Durand 001; Juha Kontinen; Jouko Väänänen (J. Comput. Syst. Sci., 2024)

Special issue on logic and complexity. - Nadia Creignou; Arnaud Durand 001; Heribert Vollmer (Math. Struct. Comput. Sci., 2024)

Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations. - Melissa Antonelli; Arnaud Durand 001; Juha Kontinen (MFCS, 2025)

The flattening operator in team-based logics. - Arnaud Durand 001; Juha Kontinen; Werner Mérian; Jouko Väänänen (CoRR, 2025)

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations. - Melissa Antonelli; Arnaud Durand 001; Juha Kontinen (CoRR, 2025)