| 2008 |
|---|
| 21 | EE | Arnaud Durand,
Miki Hermann:
On the counting complexity of propositional circumscription.
Inf. Process. Lett. 106(4): 164-170 (2008) |
| 2007 |
|---|
| 20 | EE | Guillaume Bagan,
Arnaud Durand,
Etienne Grandjean:
On Acyclic Conjunctive Queries and Constant Delay Enumeration.
CSL 2007: 208-222 |
| 19 | EE | Arnaud Durand,
Etienne Grandjean:
First-order queries on structures of bounded degree are computable with constant delay.
ACM Trans. Comput. Log. 8(4): (2007) |
| 18 | EE | Arnaud Durand,
Clemens Lautemann,
Malika More:
A simple proof of the polylog counting ability of first-order logic: guest column.
SIGACT News 38(4): 40-45 (2007) |
| 2006 |
|---|
| 17 | EE | Arnaud Durand,
Frédéric Olive:
First-Order Queries over One Unary Function.
CSL 2006: 334-348 |
| 16 | EE | Arnaud Durand,
Clemens Lautemann,
Malika More:
Counting Results in Weak Formalisms.
Circuits, Logic, and Games 2006 |
| 15 | EE | Arnaud Durand,
Etienne Grandjean:
The complexity of acyclic conjunctive queries revisited
CoRR abs/cs/0605008: (2006) |
| 14 | EE | Étienne Ailloud,
Arnaud Durand:
The Expressive Power of Bijections over Weakly Arithmetized Structures.
Theory Comput. Syst. 39(2): 297-309 (2006) |
| 2005 |
|---|
| 13 | EE | Arnaud Durand,
Etienne Grandjean:
First-order queries on structures of bounded degree are computable with constant delay
CoRR abs/cs/0507020: (2005) |
| 12 | EE | Arnaud Durand,
Miki Hermann,
Phokion G. Kolaitis:
Subtractive reductions and complete problems for counting complexity classes.
Theor. Comput. Sci. 340(3): 496-513 (2005) |
| 2003 |
|---|
| 11 | EE | Arnaud Durand,
Miki Hermann:
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete.
STACS 2003: 451-462 |
| 2002 |
|---|
| 10 | EE | Arnaud Durand,
Malika More:
Nonerasing, Counting, and Majority over the Linear Time Hierarchy.
Inf. Comput. 174(2): 132-142 (2002) |
| 9 | EE | Arnaud Durand:
Linear Time and the Power of One First-Order Universal Quantifier.
Inf. Comput. 178(1): 12-22 (2002) |
| 8 | EE | Arnaud Durand,
Miki Hermann,
Laurent Juban:
On the complexity of recognizing the Hilbert basis of a linear diophantine system.
Theor. Comput. Sci. 270(1-2): 625-642 (2002) |
| 2000 |
|---|
| 7 | EE | Arnaud Durand,
Miki Hermann,
Phokion G. Kolaitis:
Subtractive Reductions and Complete Problems for Counting Complexity Classes.
MFCS 2000: 323-332 |
| 1999 |
|---|
| 6 | | Arnaud Durand,
Miki Hermann,
Laurent Juban:
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System.
MFCS 1999: 92-102 |
| 1998 |
|---|
| 5 | | Arnaud Durand:
Modeling Cache Coherence Protocol - A Case Study with FLASH.
Workshop on Abstract State Machines 1998: 111-126 |
| 4 | | Arnaud Durand,
Clemens Lautemann,
Thomas Schwentick:
Subclasses of Binary NP.
J. Log. Comput. 8(2): 189-207 (1998) |
| 1997 |
|---|
| 3 | | Arnaud Durand,
Ronald Fagin,
Bernd Loescher:
Spectra with Only Unary Function Symbols.
CSL 1997: 189-202 |
| 1996 |
|---|
| 2 | EE | Arnaud Durand,
Solomampionona Ranaivoson:
First-Order Spectra with one Binary Predicate.
Theor. Comput. Sci. 160(1&2): 305-320 (1996) |
| 1994 |
|---|
| 1 | | Arnaud Durand,
Solomampionona Ranaivoson:
First-Order Spectra with One Binary Predicate.
CSL 1994: 177-189 |
