| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien |
Learning Read-Constant Polynomials of Constant Degree Modulo Composites.  |
CSR  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien |
The Power of Diversity. |
DCFS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Straubing, Pascal Tesson, Denis Thérien |
Weakly Iterated Block Products and Applications to Logic and Complexity. |
IJAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricard Gavaldà, Denis Thérien |
An Algebraic Perspective on Boolean Function Learning. |
ALT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Straubing, Denis Thérien |
Modular quantifiers. |
Logic and Automata |
2008 |
DBLP BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Logic Meets Algebra: the Case of Regular Languages. |
Logical Methods in Computer Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Logic Meets Algebra: the Case of Regular Languages |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ondrej Klíma, Pascal Tesson, Denis Thérien |
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien |
Languages with Bounded Multiparty Communication Complexity. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Schwentick, Denis Thérien, Heribert Vollmer (eds.) |
Circuits, Logic, and Games, 08.11. - 10.11.2006 |
Circuits, Logic, and Games |
2007 |
DBLP BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien |
Languages with Bounded Multiparty Communication Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ricard Gavaldà, Pascal Tesson, Denis Thérien |
Learning expressions and programs over monoids. |
Inf. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Bridges between Algebraic Automata Theory and Complexity Theory. |
Bulletin of the EATCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien |
Algebraic Results on Quantum Automata. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Straubing, Denis Thérien |
A Note on MODp - MODm Circuits. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer |
The many faces of a translation. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Schwentick, Denis Thérien, Heribert Vollmer |
06451 Executive Summary -- Circuits, Logic, and Games . |
Circuits, Logic, and Games |
2006 |
DBLP BibTeX RDF |
|
| 1 | Thomas Schwentick, Denis Thérien, Heribert Vollmer |
06451 Abstracts Collection -- Circuits, Logic, and Games . |
Circuits, Logic, and Games |
2006 |
DBLP BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien |
Lower bounds for circuits with MOD_m gates. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Lautemann, Pascal Tesson, Denis Thérien |
An Algebraic Point of View on the Crane Beach Property. |
CSL |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien |
Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien |
Tractable Clones of Polynomials over Semigroups |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Denis Thérien |
Imre Simon: an exceptional graduate student. |
ITA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien |
The dot-depth and the polynomial hierarchies correspond on the delta levels. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Complete Classifications for the Communication Complexity of Regular Languages. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien |
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. |
J. Comput. Syst. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Restricted Two-Variable Sentences, Circuits and Communication Complexity. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Beaudry, François Lemieux, Denis Thérien |
Groupoids That Recognize Only Regular Languages. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Koucký, Pavel Pudlák, Denis Thérien |
Bounded-depth circuits: separating wires from gates. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
communication, complexity, lower bounds, regular languages, wires, constant-depth circuits, gates |
| 1 | Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien |
Tractable Clones of Polynomials over Semigroups. |
CP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Klíma, Pascal Tesson, Denis Thérien |
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Monoids and Computations. |
IJAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien, Thomas Wilke |
Nesting Until and Since in Linear Temporal Logic. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien |
Algebraic Results on Quantum Automata. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien |
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien |
Regular Languages, Unambiguous Concatenation and Computational Complexity. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Antoine Petit, Denis Thérien |
An algebraic approach to data languages and timed languages. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Straubing, Denis Thérien |
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Denis Thérien |
Locally Commutative Categories. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Complete Classifications for the Communication Complexity of Regular Languages. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricard Gavaldà, Denis Thérien |
Algebraic Characterizations of Small Classes of Boolean Functions. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
The Computing Power of Programs over Finite Monoids. |
Journal of Automata, Languages and Combinatorics |
2002 |
DBLP BibTeX RDF |
|
| 1 | Howard Straubing, Denis Thérien |
Weakly Iterated Block Products of Finite Monoids. |
LATIN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien, Thomas Wilke |
Nesting Until and Since in Linear Temporal Logic. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
The Computing Power of Programs over Finite Monoids |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Pierre Péladeau, Denis Thérien |
On the Languages Recognized by Nilpotent Groups (a translation of "Sur les Langages Reconnus par des Groupes Nilpotents") |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Denis Thérien, Thomas Wilke |
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Antoine Petit, Denis Thérien |
An Algebraic Characterization of Data and Timed Languages. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Pascal Tesson, Denis Thérien |
Satisfiability of Systems of Equations over Finite Monoids. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Straubing, Denis Thérien |
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricard Gavaldà, Denis Thérien |
Learning Expressions over Monoids. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Beaudry, François Lemieux, Denis Thérien |
Star-Free Open Languages and Aperiodic Loops. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Schwentick, Denis Thérien, Heribert Vollmer |
Partially-Ordered Two-Way Automata: A New Characterization of DA. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien |
The Crane Beach Conjecture. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikael Goldmann, Alexander Russell, Denis Thérien |
An ergodic theorem for read-once non-uniform deterministic finite automata. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexis Maciel, Pierre Péladeau, Denis Thérien |
Programs over semigroups of dot-depth one. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, Arthur Drisko |
Circuits and Expressions with Nonassociative Gates. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer |
The Many Faces of a Translation. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien |
Equation Satisfiability and Program Satisfiability for Finite Monoids. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexis Maciel, Denis Thérien |
Efficient Threshold Circuits for Power Series. |
Inf. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Augustin Baziramwabo, Pierre McKenzie, Denis Thérien |
Modular Temporal Logic. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
semigroup theory, temporal logic, finite model theory |
| 1 | Alexis Maciel, Denis Thérien |
Threshold Circuits of Small Majority-Depth. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer |
Nondeterministic NC1 Computation. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Raymond, Pascal Tesson, Denis Thérien |
An Algebraic Approach to Communication Complexity. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien, Thomas Wilke |
Over Words, Two Variables Are as Powerful as One Quantifier Alternation. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Péladeau, Howard Straubing, Denis Thérien |
Finite Semigroup Varieties Defined by Programs. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien |
Finite Moniods: From Word to Circuit Evaluation. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Beaudry, François Lemieux, Denis Thérien |
Finite Loops Recognize Exactly the Regular Open Languages. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien |
Circuits and Expressions with NOn-Associative Gates. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
non-associative gates, non-associative groupoid, polyabelian groupoids, arbitrary Boolean functions, NC/sup 1/-complete, CIRCUIT VALUE, Boolean functions, multiplication, P-complete, EXPRESSION EVALUATION |
| 1 | Birgit Jenner, Pierre McKenzie, Denis Thérien |
Logspace and Logtime Leaf Languages. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien, Thomas Wilke |
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
semidirect products, until hierarchy, finite semigroups, algebraic characterization, nesting depth, finite semigroup theory, temporal logic, temporal logic |
| 1 | Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer |
Nondeterministic NC1 Computation. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
nondeterministic Turing machine, leaf language, Computational complexity, circuit |
| 1 | Howard Straubing, Denis Thérien, Wolfgang Thomas |
Regular Languages Defined with Generalized Quanifiers |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien |
Circuits Constructed with Mod_q Gates Cannot Compute "And" in Sublinear Size. |
Computational Complexity |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Denis Thérien |
Special Issue on Circuit Complexity: Foreword. |
Computational Complexity |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Lautemann, Thomas Schwentick, Denis Thérien |
Logics For Context-Free Languages. |
CSL |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Birgit Jenner, Pierre McKenzie, Denis Thérien |
Logspace and Logtime Leaf Languages. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Alexis Maciel, Denis Thérien |
Threshold Circuits for Iterated Multiplication: Using AC0 for Free. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Eric Pin, Howard Straubing, Denis Thérien |
Some Results on the Generalized Star-Height Problem |
Inf. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Beaudry, Pierre McKenzie, Denis Thérien |
The Membership Problem in Aperiodic Transformation Monoids. |
J. ACM |
1992 |
DBLP DOI BibTeX RDF |
aperiodic, membership, varieties, monoids |
| 1 | David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien |
Regular Languages in NC¹. |
J. Comput. Syst. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien |
Circuits Constructed with MODq Gates Cannot Compute AND in Sublinear Size. |
LATIN |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Pierre Péladeau, Denis Thérien |
NC¹: The Automata-Theoretic Viewpoint. |
Computational Complexity |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Howard Straubing, Denis Thérien |
Non-Uniform Automata Over Groups |
Inf. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien |
Programs over Aperiodic Monoids. |
Theor. Comput. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre McKenzie, Denis Thérien |
Automata Theory Meets Circuit Complexity. |
ICALP |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Beaudry, Pierre McKenzie, Denis Thérien |
Testing Membership: Beyond Permutation Groups (Extended Abstract). |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Eric Pin, Howard Straubing, Denis Thérien |
New Results on the Generalized Star-Height Problem. |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien |
Categories Et Langages De Dot-Depth Un. |
ITA |
1988 |
DBLP BibTeX RDF |
|
| 1 | David A. Mix Barrington, Denis Thérien |
Finite monoids and the fine structure of NC1. |
J. ACM |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Straubing, Denis Thérien, Wolfgang Thomas |
regular Languages Defined with Generalized Quantifiers. |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Straubing, Denis Thérien |
Finite automata and computational complexity. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Denis Thérien |
Non-Uniform Automata Over Groups. |
ICALP |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Denis Thérien |
Finite Monoids and the Fine Structure of NC¹ |
STOC |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Weiss, Denis Thérien |
Varieties of Finite Categories. |
ITA |
1986 |
DBLP BibTeX RDF |
|
| 1 | Denis Thérien |
Classification of Finite Monoids: The Language Approach. |
Theor. Comput. Sci. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Thérien |
Languages of Nilpotent and Solvable Groups (Extended Abstract). |
ICALP |
1979 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")