Arnaud Durand

	2012
31		Arnaud Durand, Miki Hermann, Gustav Nordh: Trichotomies in the Complexity of Minimal Inference. Theory Comput. Syst. 50(3): 446-491 (2012)
	2011
30		Arnaud Durand, Yann Strozecki: Enumeration Complexity of Logical Query Problems with Second-order Variables. CSL 2011: 189-202
29		Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer: Dependence logic with a majority quantifier. FSTTCS 2011: 252-263
28		Arnaud Durand, Juha Kontinen: Hierarchies in Dependence Logic CoRR abs/1105.3324: (2011)
27		Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer: Dependence logic with a majority quantifier CoRR abs/1109.4750: (2011)
26		Arnaud Durand, Stefan Mengel: On Polynomials Defined by Acyclic Conjunctive Queries and Weighted Counting Problems CoRR abs/1110.4201: (2011)
25		Arnaud Durand, Michel Habib: Complexity issues for the sandwich homogeneous set problem. Discrete Applied Mathematics 159(7): 574-580 (2011)
	2010
24		Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin: Efficient Enumeration for Conjunctive Queries over X-underbar Structures. CSL 2010: 80-94
	2009
23		Arnaud Durand, Miki Hermann, Gustav Nordh: Trichotomy in the Complexity of Minimal Inference. LICS 2009: 387-396
	2008
22		Guillaume Bagan, Arnaud Durand, Etienne Grandjean, Frédéric Olive: Computing the jth solution of a first-order query. ITA 42(1): 147-164 (2008)
21		Arnaud Durand, Miki Hermann: On the counting complexity of propositional circumscription. Inf. Process. Lett. 106(4): 164-170 (2008)
	2007
20		Guillaume Bagan, Arnaud Durand, Etienne Grandjean: On Acyclic Conjunctive Queries and Constant Delay Enumeration. CSL 2007: 208-222
19		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		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		Arnaud Durand, Frédéric Olive: First-Order Queries over One Unary Function. CSL 2006: 334-348
16		Arnaud Durand, Clemens Lautemann, Malika More: Counting Results in Weak Formalisms. Circuits, Logic, and Games 2006
15		Arnaud Durand, Etienne Grandjean: The complexity of acyclic conjunctive queries revisited CoRR abs/cs/0605008: (2006)
14		Étienne Ailloud, Arnaud Durand: The Expressive Power of Bijections over Weakly Arithmetized Structures. Theory Comput. Syst. 39(2): 297-309 (2006)
	2005
13		Arnaud Durand, Etienne Grandjean: First-order queries on structures of bounded degree are computable with constant delay CoRR abs/cs/0507020: (2005)
12		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		Arnaud Durand, Miki Hermann: The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. STACS 2003: 451-462
	2002
10		Arnaud Durand, Malika More: Nonerasing, Counting, and Majority over the Linear Time Hierarchy. Inf. Comput. 174(2): 132-142 (2002)
9		Arnaud Durand: Linear Time and the Power of One First-Order Universal Quantifier. Inf. Comput. 178(1): 12-22 (2002)
8		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		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		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

Coauthor Index

1	Étienne Ailloud	[14]
2	Guillaume Bagan	[20] [22] [24]
3	Johannes Ebbing	[27] [29]
4	Ronald Fagin	[3]
5	Emmanuel Filiot	[24]
6	Olivier Gauwin	[24]
7	Etienne Grandjean	[13] [15] [19] [20] [22]
8	Michel Habib	[25]
9	Miki Hermann	[6] [7] [8] [11] [12] [21] [23] [31]
10	Laurent Juban	[6] [8]
11	Phokion G. Kolaitis	[7] [12]
12	Juha Kontinen	[27] [28] [29]
13	Clemens Lautemann	[4] [16] [18]
14	Bernd Loescher	[3]
15	Stefan Mengel	[26]
16	Malika More	[10] [16] [18]
17	Gustav Nordh	[23] [31]
18	Frédéric Olive	[17] [22]
19	Solomampionona Ranaivoson	[1] [2]
20	Thomas Schwentick	[4]
21	Yann Strozecki	[30]
22	Heribert Vollmer	[27] [29]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page