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
Hilfe
Suche: Author="Th{\'e}rien, Denis"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning read-constant polynomials of constant degree modulo composites
Arkadev Chattopadhyay
,
Ricard Gavaldà
,
Kristoffer Arnsfelt Hansen
,
Denis Thérien
Theory of Computing Systems
55
(2), 2014, pp. 404-420
Languages with bounded multiparty communication complexity
Arkadev Chattopadhyay
,
Andreas Krebs
,
Michal Koucký
,
Mario Szegedy
,
Pascal Tesson
,
Denis Thérien
Lecture Notes in Computer Science
4393
, 2007, pp. 500-511
Algebraic results on quantum automata
Andris Ambainis
,
Martin Beaudry
,
Marats Golovkins
,
Arnolds Ķikusts
,
Mark Mercer
,
Denis Thérien
Theory of Computing Systems
39
(1), 2006, pp. 165-188
Learning expressions and programs over monoids
Ricard Gavaldà
,
Pascal Tesson
,
Denis Thérien
Information and Computation
204
(2), 2006, pp. 177-209
The many faces of a translation
Pierre McKenzie
,
Thomas Schwentick
,
Denis Thérien
,
Heribert Vollmer
Journal of Computer and System Sciences
72
(1), 2006, pp. 163-179
A note on MOD
_p
- MOD
m
circuits
Howard Straubing
,
Denis Thérien
Theory of Computing Systems
39
(5), 2006, pp. 699-706
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
David A. Mix Barrington
,
Neil Immerman
,
Clemens Lautemann
,
Nicole Schweikardt
,
Denis Thérien
Journal of Computer and System Sciences
70
(2), 2005, pp. 101-127
Groupoids that recognize only regular languages
Martin Beaudry
,
François Lemieux
,
Denis Thérien
Lecture Notes in Computer Science
3580
, 2005, pp. 421-433
Restricted two-variable
FO+MOD
sentences, circuits and communication complexity
Pascal Tesson
,
Denis Thérien
Lecture Notes in Computer Science
3580
, 2005, pp. 526-538
Complete classifications for the communication complexity of regular languages
Pascal Tesson
,
Denis Thérien
Theory of Computing Systems
38
(2), 2005, pp. 135-159
Algebraic results on quantum automata
Andris Ambainis
,
Martin Beaudry
,
Marats Golovkins
,
Arnolds Ķikusts
,
Mark Mercer
,
Denis Thérien
Lecture Notes in Computer Science
2996
, 2004, pp. 93-104
Nesting until and since in linear temporal logic
Denis Thérien
,
Thomas Wilke
Theory of Computing Systems
37
(1), 2004, pp. 111-131
Regular languages, unambiguous concatenation and computational complexity
Denis Thérien
Lecture Notes in Computer Science
3328
, 2004, pp. 49-57
Locally commutative categories
Arkadev Chattopadhyay
,
Denis Thérien
Lecture Notes in Computer Science
2719
, 2003, pp. 984-995
Algebraic characterizations of small classes of Boolean functions
Ricard Gavaldà
,
Denis Thérien
Lecture Notes in Computer Science
2607
, 2003, pp. 331-342
Regular languages defined by generalized first-order formulas with a bounded number of bound variables
Howard Straubing
,
Denis Thérien
Theory of Computing Systems
36
(1), 2003, pp. 29-69
Complete classifications for the communication complexity of regular languages
Pascal Tesson
,
Denis Thérien
Lecture Notes in Computer Science
2607
, 2003, pp. 62-73
Equation satisfiability and program satisfiability for finite monoids
David Mix Barrington
,
Pierre McKenzie
,
Cris Moore
,
Pascal Tesson
,
Denis Thérien
Lecture Notes in Computer Science
1893
, 2000, pp. 172-181
Closures on COPs form complete lattices
Alexis Maciel
,
Denis Thérien
Information and Computation
152
(1), 1999, pp. 62-73
Threshold circuits of small majority-depth
Alexis Maciel
,
Denis Thérien
Information and Computation
146
(1), 1998, pp. 55-83
Finite monoids: From word to circuit evaluation
Martin Beaudry
,
Pierre McKenzie
,
Pierre Péladeau
,
Denis Thérien
SIAM Journal on Computing
26
(1), 1997, pp. 138-152
Logspace and logtime leaf languages
Birgit Jenner
,
Pierre McKenzie
,
Denis Thérien
Information and Computation
129
(1), 1996, pp. 21-33
Regular languages defined with generalized quantifiers
Howard Straubing
,
Denis Thérien
,
Wolfgang Thomas
Information and Computation
118
(2), 1995, pp. 289-301
Threshold circuits for iterated multiplication: Using
\mbox{AC}^0
for free
Alexis Maciel
,
Denis Thérien
Lecture Notes in Computer Science
665
, 1993, pp. 545-554
Regular languages in
NC^1
David A. Mix Barrington
,
Kevin Compton
,
Howard Straubing
,
Denis Thérien
Journal of Computer and System Sciences
44
, 1992, pp. 478-499
Seiten 1
2
>