Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Durand, Arnaud"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Homomorphism polynomials complete for VP
Arnaud Durand
,
Meena Mahajan
,
Guillaume Malod
,
Nicolas de Rugy-Altherre
,
Nitin Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 493-504
The complexity of weighted counting for acyclic conjunctive queries
Arnaud Durand
,
Stefan Mengel
Journal of Computer and System Sciences
80
(1), 2014, pp. 277-296
The arithmetic complexity of tensor contractions
Florent Capelli
,
Arnaud Durand
,
Stefan Mengel
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 365-376
Trichotomies in the complexity of minimal inference
Arnaud Durand
,
Miki Hermann
,
Gustav Nordh
Theory of Computing Systems
50
(3), 2012, pp. 446-491
Dependence logic with a majority quantifier
Arnaud Durand
,
Johannes Ebbing
,
Juha Kontinen
,
Heribert Vollmer
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 252-263
On the counting complexity of propositional circumscription
Arnaud Durand
,
Miki Hermann
Information Processing Letters
106
(4), 2008, pp. 164-170
The expressive power of bijections over weakly arithmetized structures
Étienne Ailloud
,
Arnaud Durand
Theory of Computing Systems
39
(2), 2006, pp. 297-309
Subtractive reductions and complete problems for counting complexity classes
Arnaud Durand
,
Miki Hermann
,
Phokion G. Kolaitis
Theoretical Computer Science
340
(3), 2005, pp. 496-513
The inference problem for propositional circumscription of affine formulas is co
NP
-complete
Arnaud Durand
,
Miki Hermann
Lecture Notes in Computer Science
2607
, 2003, pp. 451-462
On the complexity of recognizing the Hilbert basis of a linear diophantine system
Arnaud Durand
,
Miki Hermann
,
Laurent Juban
Theoretical Computer Science
270
(1-2), 2002, pp. 625-642
Nonerasing, counting, and majority over the linear time hierarchy
Arnaud Durand
,
Malika More
Information and Computation
174
(2), 2002, pp. 132-142
Linear time and the power of one first-order universal quantifier
Arnaud Durand
Information and Computation
178
(1), 2002, pp. 12-22
Subtractive reductions and complete problems for counting complexity classes
Arnaud Durand
,
Miki Hermann
,
Phokion G. Kolaitis
Lecture Notes in Computer Science
1893
, 2000, pp. 323-332
On the complexity of recognizing the Hilbert basis of a linear diophantine system
Arnaud Durand
,
Miki Hermann
,
Laurent Juban
Lecture Notes in Computer Science
1672
, 1999, pp. 92-102
First-order spectra with one binary predicate
Arnaud Durand
,
Solomampionona Ranaivoson
Theoretical Computer Science
160
(1-2), 1996, pp. 305-320