dblp.uni-trier.dewww.uni-trier.de

Arnaud Durand

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
21EEArnaud Durand, Miki Hermann: On the counting complexity of propositional circumscription. Inf. Process. Lett. 106(4): 164-170 (2008)
2007
20EEGuillaume Bagan, Arnaud Durand, Etienne Grandjean: On Acyclic Conjunctive Queries and Constant Delay Enumeration. CSL 2007: 208-222
19EEArnaud Durand, Etienne Grandjean: First-order queries on structures of bounded degree are computable with constant delay. ACM Trans. Comput. Log. 8(4): (2007)
18EEArnaud 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
17EEArnaud Durand, Frédéric Olive: First-Order Queries over One Unary Function. CSL 2006: 334-348
16EEArnaud Durand, Clemens Lautemann, Malika More: Counting Results in Weak Formalisms. Circuits, Logic, and Games 2006
15EEArnaud Durand, Etienne Grandjean: The complexity of acyclic conjunctive queries revisited CoRR abs/cs/0605008: (2006)
14EEÉtienne Ailloud, Arnaud Durand: The Expressive Power of Bijections over Weakly Arithmetized Structures. Theory Comput. Syst. 39(2): 297-309 (2006)
2005
13EEArnaud Durand, Etienne Grandjean: First-order queries on structures of bounded degree are computable with constant delay CoRR abs/cs/0507020: (2005)
12EEArnaud Durand, Miki Hermann, Phokion G. Kolaitis: Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3): 496-513 (2005)
2003
11EEArnaud Durand, Miki Hermann: The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. STACS 2003: 451-462
2002
10EEArnaud Durand, Malika More: Nonerasing, Counting, and Majority over the Linear Time Hierarchy. Inf. Comput. 174(2): 132-142 (2002)
9EEArnaud Durand: Linear Time and the Power of One First-Order Universal Quantifier. Inf. Comput. 178(1): 12-22 (2002)
8EEArnaud 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
7EEArnaud 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
2EEArnaud 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

Coauthor Index

1Étienne Ailloud [14]
2Guillaume Bagan [20]
3Ronald Fagin [3]
4Etienne Grandjean [13] [15] [19] [20]
5Miki Hermann [6] [7] [8] [11] [12] [21]
6Laurent Juban [6] [8]
7Phokion G. Kolaitis [7] [12]
8Clemens Lautemann [4] [16] [18]
9Bernd Loescher [3]
10Malika More [10] [16] [18]
11Frédéric Olive [17]
12Solomampionona Ranaivoson [1] [2]
13Thomas Schwentick [4]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)