| 2026 | ICALP | Recursion and Proof Theoretical Characterizations of Small Circuit Classes with Modulo Counting via Discrete Differential Equations. | Melissa Antonelli, Arnaud Durand, Rui Li |
| 2025 | MFCS | Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations. | Melissa Antonelli, Arnaud Durand, Juha Kontinen |
| 2024 | MFCS | A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations. | Melissa Antonelli, Arnaud Durand, Juha Kontinen |
| 2022 | MFCS | Enumeration Classes Defined by Circuits. | Nadia Creignou, Arnaud Durand, Heribert Vollmer |
| 2020 | PODS | Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration. | Arnaud Durand |
| 2019 | MFCS | Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. | Olivier Bournez, Arnaud Durand |
| 2018 | LICS | Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. | Arnaud Durand, Anselm Haak, Heribert Vollmer |
| 2018 | Mobisys | Resilient, crowd-sourced LPWAN infrastructure using blockchain. | Arnaud Durand, Pascal Gremaud, Jacques Pasquier |
| 2016 | CSL | Descriptive Complexity of #AC | Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer |
| 2014 | IGARSS | Applicative potential of digital surface models derived from Pleiades-HR tri-stereoscopic acquisitions and TerraSAR-X/TanDEM-X interferometric pairs in a range of thematic domain. | Henri Giraud, Arnaud Durand, Mathilde Caspard, Claire Huber, Jrme Maxant, Paul de Fraipont, Claire Tinel, Julien Michel |
| 2014 | PODS | Enumerating answers to first-order queries over databases of low degree. | Arnaud Durand, Nicole Schweikardt, Luc Segoufin |
| 2014 | SAT | Hypergraph Acyclicity and Propositional Model Counting. | Florent Capelli, Arnaud Durand, Stefan Mengel |
| 2013 | ICDT | Structural tractability of counting of solutions to conjunctive queries. | Arnaud Durand, Stefan Mengel |
| 2013 | STACS | The arithmetic complexity of tensor contractions. | Florent Capelli, Arnaud Durand, Stefan Mengel |
| 2011 | CSL | Enumeration Complexity of Logical Query Problems with Second-order Variables. | Arnaud Durand, Yann Strozecki |
| 2010 | CSL | Efficient Enumeration for Conjunctive Queries over X-underbar Structures. | Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin |
| 2009 | LICS | Trichotomy in the Complexity of Minimal Inference. | Arnaud Durand, Miki Hermann, Gustav Nordh |
| 2007 | CSL | On Acyclic Conjunctive Queries and Constant Delay Enumeration. | Guillaume Bagan, Arnaud Durand, Etienne Grandjean |
| 2006 | CSL | First-Order Queries over One Unary Function. | Arnaud Durand, Frdric Olive |
| 2003 | STACS | The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. | Arnaud Durand, Miki Hermann |
| 2000 | MFCS | Subtractive Reductions and Complete Problems for Counting Complexity Classes. | Arnaud Durand, Miki Hermann, Phokion G. Kolaitis |
| 1999 | MFCS | On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. | Arnaud Durand, Miki Hermann, Laurent Juban |
| 1997 | CSL | Spectra with Only Unary Function Symbols. | Arnaud Durand, Ronald Fagin, Bernd Loescher |
| 1994 | CSL | First-Order Spectra with One Binary Predicate. | Arnaud Durand, Solomampionona Ranaivoson |