Denis Thérien

Publication Activity (10 Years)

Years Active: 1979-2021
Publications (10 Years): 1

Top Venues

CoRR

Theory Comput. Syst.

Publications

Nicholas Roy, Ingmar Posner, Tim D. Barfoot, Philippe Beaudoin, Yoshua Bengio, Jeannette Bohg, Oliver Brock, Isabelle Depatie, Dieter Fox, Daniel E. Koditschek, Tomás Lozano-Pérez, Vikash Mansinghka, Christopher J. Pal, Blake A. Richards, Dorsa Sadigh, Stefan Schaal, Gaurav S. Sukhatme, Denis Thérien, Marc Toussaint, Michiel van de Panne
From Machine Learning to Robotics: Challenges and Opportunities for Embodied Intelligence. CoRR (2021)
Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. Theory Comput. Syst. 55 (2) (2014)
Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. CSR (2011)
Denis Thérien
The Power of Diversity. DCFS (2011)
Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
10061 Executive Summary - Circuits, Logic, and Games. Circuits, Logic, and Games (2010)
Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
10061 Abstracts Collection - Circuits, Logic, and Games. Circuits, Logic, and Games (2010)
Howard Straubing, Pascal Tesson, Denis Thérien
Weakly Iterated Block Products and Applications to Logic and Complexity. Int. J. Algebra Comput. 20 (2) (2010)
Ricard Gavaldà, Denis Thérien
An Algebraic Perspective on Boolean Function Learning. ALT (2009)
Howard Straubing, Denis Thérien
Modular quantifiers. Logic and Automata (2008)
Pascal Tesson, Denis Thérien
Logic Meets Algebra: the Case of Regular Languages. Log. Methods Comput. Sci. 3 (1) (2007)
Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien
Languages with Bounded Multiparty Communication Complexity. STACS (2007)
Ondrej Klíma, Pascal Tesson, Denis Thérien
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. Theory Comput. Syst. 40 (3) (2007)
Pascal Tesson, Denis Thérien
Logic Meets Algebra: the Case of Regular Languages CoRR (2007)
Howard Straubing, Denis Thérien
Circuits. Theory Comput. Syst. 39 (5) (2006)
Clemens Lautemann, Pascal Tesson, Denis Thérien
An Algebraic Point of View on the Crane Beach Property. CSL (2006)
Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien
Lower bounds for circuits with MOD_m gates. FOCS (2006)
Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
Algebraic Results on Quantum Automata. Theory Comput. Syst. 39 (1) (2006)
Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
The many faces of a translation. J. Comput. Syst. Sci. 72 (1) (2006)
Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien
Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. Computational Complexity Conference (2006)
Thomas Schwentick, Denis Thérien, Heribert Vollmer
06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games (2006)
Thomas Schwentick, Denis Thérien, Heribert Vollmer
06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games (2006)
Pascal Tesson, Denis Thérien
Bridges between Algebraic Automata Theory and Complexity Theory. Bull. EATCS 88 (2006)
Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien
Languages with Bounded Multiparty Communication Complexity. Electron. Colloquium Comput. Complex. 13 (117) (2006)
Ricard Gavaldà, Pascal Tesson, Denis Thérien
Learning expressions and programs over monoids. Inf. Comput. 204 (2) (2006)
Pascal Tesson, Denis Thérien
Restricted Two-Variable Sentences, Circuits and Communication Complexity. ICALP (2005)
Michal Koucký, Pavel Pudlák, Denis Thérien
Bounded-depth circuits: separating wires from gates. STOC (2005)
Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
Tractable Clones of Polynomials over Semigroups. CP (2005)
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. 16 (4) (2005)
Martin Beaudry, François Lemieux, Denis Thérien
Groupoids That Recognize Only Regular Languages. ICALP (2005)
Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
Tractable Clones of Polynomials over Semigroups Electron. Colloquium Comput. Complex. (059) (2005)
Denis Thérien
Imre Simon: an exceptional graduate student. RAIRO Theor. Informatics Appl. 39 (1) (2005)
Pascal Tesson, Denis Thérien
Complete Classifications for the Communication Complexity of Regular Languages. Theory Comput. Syst. 38 (2) (2005)
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. 70 (2) (2005)
Denis Thérien
Regular Languages, Unambiguous Concatenation and Computational Complexity. FSTTCS (2004)
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)
Pascal Tesson, Denis Thérien
Monoids and Computations. Int. J. Algebra Comput. 14 (5-6) (2004)
Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
Algebraic Results on Quantum Automata. STACS (2004)
Denis Thérien, Thomas Wilke
Nesting Until and Since in Linear Temporal Logic. Theory Comput. Syst. 37 (1) (2004)
Ondrej Klíma, Pascal Tesson, Denis Thérien
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups Electron. Colloquium Comput. Complex. (091) (2004)
Howard Straubing, Denis Thérien
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. Theory Comput. Syst. 36 (1) (2003)
Ricard Gavaldà, Denis Thérien
Algebraic Characterizations of Small Classes of Boolean Functions. STACS (2003)
Patricia Bouyer, Antoine Petit, Denis Thérien
An algebraic approach to data languages and timed languages. Inf. Comput. 182 (2) (2003)
Arkadev Chattopadhyay, Denis Thérien
Locally Commutative Categories. ICALP (2003)
Pascal Tesson, Denis Thérien
Complete Classifications for the Communication Complexity of Regular Languages. STACS (2003)
Howard Straubing, Denis Thérien
Weakly Iterated Block Products of Finite Monoids. LATIN (2002)
Denis Thérien, Thomas Wilke
Nesting Until and Since in Linear Temporal Logic. STACS (2002)
Pascal Tesson, Denis Thérien
The Computing Power of Programs over Finite Monoids. J. Autom. Lang. Comb. 7 (2) (2002)
Martin Beaudry, François Lemieux, Denis Thérien
Star-Free Open Languages and Aperiodic Loops. STACS (2001)
Howard Straubing, Denis Thérien
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. STACS (2001)
Pascal Tesson, Denis Thérien
The Computing Power of Programs over Finite Monoids Electron. Colloquium Comput. Complex. 8 (5) (2001)
Cristopher Moore, Pascal Tesson, Denis Thérien
Satisfiability of Systems of Equations over Finite Monoids. MFCS (2001)
Ricard Gavaldà, Denis Thérien
Learning Expressions over Monoids. STACS (2001)
Pierre Péladeau, Denis Thérien
On the Languages Recognized by Nilpotent Groups (a translation of "Sur les Langages Reconnus par des Groupes Nilpotents") Electron. Colloquium Comput. Complex. 8 (40) (2001)
Denis Thérien, Thomas Wilke
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. SIAM J. Comput. 31 (3) (2001)
David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
The Crane Beach Conjecture. LICS (2001)
Patricia Bouyer, Antoine Petit, Denis Thérien
An Algebraic Characterization of Data and Timed Languages. CONCUR (2001)
Thomas Schwentick, Denis Thérien, Heribert Vollmer
Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory (2001)
Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, Arthur Drisko
Circuits and Expressions with Nonassociative Gates. J. Comput. Syst. Sci. 60 (2) (2000)
Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
The Many Faces of a Translation. ICALP (2000)
Mikael Goldmann, Alexander Russell, Denis Thérien
An ergodic theorem for read-once non-uniform deterministic finite automata. Inf. Process. Lett. 73 (1-2) (2000)
David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien
Equation Satisfiability and Program Satisfiability for Finite Monoids. MFCS (2000)
Alexis Maciel, Pierre Péladeau, Denis Thérien
Programs over semigroups of dot-depth one. Theor. Comput. Sci. 245 (1) (2000)
Augustin Baziramwabo, Pierre McKenzie, Denis Thérien
Modular Temporal Logic. LICS (1999)
Alexis Maciel, Denis Thérien
Efficient Threshold Circuits for Power Series. Inf. Comput. 152 (1) (1999)
Denis Thérien, Thomas Wilke
Over Words, Two Variables Are as Powerful as One Quantifier Alternation. STOC (1998)
Jean-François Raymond, Pascal Tesson, Denis Thérien
An Algebraic Approach to Communication Complexity. ICALP (1998)
Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
Computation. J. Comput. Syst. Sci. 57 (2) (1998)
Alexis Maciel, Denis Thérien
Threshold Circuits of Small Majority-Depth. Inf. Comput. 146 (1) (1998)
Martin Beaudry, François Lemieux, Denis Thérien
Finite Loops Recognize Exactly the Regular Open Languages. ICALP (1997)
Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien
Finite Moniods: From Word to Circuit Evaluation. SIAM J. Comput. 26 (1) (1997)
Pierre Péladeau, Howard Straubing, Denis Thérien
Finite Semigroup Varieties Defined by Programs. Theor. Comput. Sci. 180 (1-2) (1997)
Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien
Circuits and Expressions with NOn-Associative Gates. Computational Complexity Conference (1997)
Birgit Jenner, Pierre McKenzie, Denis Thérien
Logspace and Logtime Leaf Languages. Inf. Comput. 129 (1) (1996)
Denis Thérien, Thomas Wilke
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. FOCS (1996)
Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
Computation. Computational Complexity Conference (1996)
Howard Straubing, Denis Thérien, Wolfgang Thomas
Regular Languages Defined with Generalized Quanifiers Inf. Comput. 118 (2) (1995)
Pierre McKenzie, Denis Thérien
Special Issue on Circuit Complexity: Foreword. Comput. Complex. 4 (1994)
Birgit Jenner, Pierre McKenzie, Denis Thérien
Logspace and Logtime Leaf Languages. Computational Complexity Conference (1994)
Denis Thérien
Circuits Constructed with Mod_q Gates Cannot Compute "And" in Sublinear Size. Comput. Complex. 4 (1994)
Clemens Lautemann, Thomas Schwentick, Denis Thérien
Logics For Context-Free Languages. CSL (1994)
Jean-Eric Pin, Denis Thérien
The Bideterministic Concatenation Product. Int. J. Algebra Comput. 3 (4) (1993)
Alexis Maciel, Denis Thérien
Threshold Circuits for Iterated Multiplication: Using AC0 for Free. STACS (1993)
David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien
Regular Languages in NC¹. J. Comput. Syst. Sci. 44 (3) (1992)
Jean-Eric Pin, Howard Straubing, Denis Thérien
Some Results on the Generalized Star-Height Problem Inf. Comput. 101 (2) (1992)
Denis Thérien
in Sublinear Size. LATIN (1992)
Martin Beaudry, Pierre McKenzie, Denis Thérien
The Membership Problem in Aperiodic Transformation Monoids. J. ACM 39 (3) (1992)
Pierre McKenzie, Pierre Péladeau, Denis Thérien
NC¹: The Automata-Theoretic Viewpoint. Comput. Complex. 1 (1991)
David A. Mix Barrington, Howard Straubing, Denis Thérien
Non-Uniform Automata Over Groups Inf. Comput. 89 (2) (1990)
Jean-Eric Pin, Howard Straubing, Denis Thérien
New Results on the Generalized Star-Height Problem. STACS (1989)
Pierre McKenzie, Denis Thérien
Automata Theory Meets Circuit Complexity. ICALP (1989)
Denis Thérien
Programs over Aperiodic Monoids. Theor. Comput. Sci. 64 (3) (1989)
Martin Beaudry, Pierre McKenzie, Denis Thérien
Testing Membership: Beyond Permutation Groups (Extended Abstract). STACS (1989)
Howard Straubing, Denis Thérien
Finite automata and computational complexity. Formal Properties of Finite Automata and Applications (1988)
Howard Straubing, Denis Thérien, Wolfgang Thomas
regular Languages Defined with Generalized Quantifiers. ICALP (1988)
Denis Thérien
Categories Et Langages De Dot-Depth Un. RAIRO Theor. Informatics Appl. 22 (4) (1988)
David A. Mix Barrington, Denis Thérien
. J. ACM 35 (4) (1988)
David A. Mix Barrington, Denis Thérien
Finite Monoids and the Fine Structure of NC¹ STOC (1987)
David A. Mix Barrington, Denis Thérien
Non-Uniform Automata Over Groups. ICALP (1987)
Alex Weiss, Denis Thérien
Varieties of Finite Categories. RAIRO Theor. Informatics Appl. 20 (3) (1986)
Denis Thérien
Classification of Finite Monoids: The Language Approach. Theor. Comput. Sci. 14 (1981)

Denis Thérien.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Denis Thérien