default search action
Denis Thérien
Person information
- affiliation: McGill University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
- [i11]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 abs/2110.15245 (2021)
2010 – 2019
- 2014
- [j42]Arkadev Chattopadhyay, Ricard Gavaldà
, Kristoffer Arnsfelt Hansen
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. Theory Comput. Syst. 55(2): 404-420 (2014) - 2011
- [c48]Arkadev Chattopadhyay, Ricard Gavaldà
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. CSR 2011: 29-42 - [c47]Denis Thérien:
The Power of Diversity. DCFS 2011: 43-54 - 2010
- [j41]Howard Straubing, Pascal Tesson, Denis Thérien:
Weakly Iterated Block Products and Applications to Logic and Complexity. Int. J. Algebra Comput. 20(2): 319-341 (2010) - [e2]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Circuits, Logic, and Games, 07.02. - 12.02.2010. Dagstuhl Seminar Proceedings 10061, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i10]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Abstracts Collection - Circuits, Logic, and Games. Circuits, Logic, and Games 2010 - [i9]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Executive Summary - Circuits, Logic, and Games. Circuits, Logic, and Games 2010
2000 – 2009
- 2009
- [c46]Ricard Gavaldà
An Algebraic Perspective on Boolean Function Learning. ALT 2009: 201-215 - 2008
- [c45]Howard Straubing, Denis Thérien:
Modular quantifiers. Logic and Automata 2008: 613-628 - 2007
- [j40]Pascal Tesson, Denis Thérien:
Logic Meets Algebra: the Case of Regular Languages. Log. Methods Comput. Sci. 3(1) (2007) - [j39]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): 263-297 (2007) - [c44]Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien:
Languages with Bounded Multiparty Communication Complexity. STACS 2007: 500-511 - [e1]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Circuits, Logic, and Games, 08.11. - 10.11.2006. Dagstuhl Seminar Proceedings 06451, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i8]Pascal Tesson, Denis Thérien:
Logic Meets Algebra: the Case of Regular Languages. CoRR abs/cs/0701154 (2007) - 2006
- [j38]Pascal Tesson, Denis Thérien:
Bridges between Algebraic Automata Theory and Complexity Theory. Bull. EATCS 88: 37-64 (2006) - [j37]Ricard Gavaldà
Learning expressions and programs over monoids. Inf. Comput. 204(2): 177-209 (2006) - [j36]Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006) - [j35]Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien:
Algebraic Results on Quantum Automata. Theory Comput. Syst. 39(1): 165-188 (2006) - [j34]Howard Straubing, Denis Thérien:
A Note on MODp - MODm Circuits. Theory Comput. Syst. 39(5): 699-706 (2006) - [c43]Michal Koucký
Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. CCC 2006: 190-201 - [c42]Clemens Lautemann, Pascal Tesson, Denis Thérien:
An Algebraic Point of View on the Crane Beach Property. CSL 2006: 426-440 - [c41]Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien:
Lower bounds for circuits with MOD_m gates. FOCS 2006: 709-718 - [i7]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006 - [i6]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006 - [i5]Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien:
Languages with Bounded Multiparty Communication Complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j33]Bernd Borchert, Klaus-Jörn Lange, Frank Stephan
The dot-depth and the polynomial hierarchies correspond on the delta levels. Int. J. Found. Comput. Sci. 16(4): 625-644 (2005) - [j32]Denis Thérien:
Imre Simon: an exceptional graduate student. RAIRO Theor. Informatics Appl. 39(1): 297-304 (2005) - [j31]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): 101-127 (2005) - [j30]Pascal Tesson, Denis Thérien:
Complete Classifications for the Communication Complexity of Regular Languages. Theory Comput. Syst. 38(2): 135-159 (2005) - [c40]Víctor Dalmau
Tractable Clones of Polynomials over Semigroups. CP 2005: 196-210 - [c39]Martin Beaudry, François Lemieux, Denis Thérien:
Groupoids That Recognize Only Regular Languages. ICALP 2005: 421-433 - [c38]Pascal Tesson, Denis Thérien:
Restricted Two-Variable Sentences, Circuits and Communication Complexity. ICALP 2005: 526-538 - [c37]Michal Koucký, Pavel Pudlák, Denis Thérien:
Bounded-depth circuits: separating wires from gates. STOC 2005: 257-265 - [i4]Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien:
Tractable Clones of Polynomials over Semigroups. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j29]Pascal Tesson, Denis Thérien:
Monoids and Computations. Int. J. Algebra Comput. 14(5-6): 801-816 (2004) - [j28]Denis Thérien, Thomas Wilke:
Nesting Until and Since in Linear Temporal Logic. Theory Comput. Syst. 37(1): 111-131 (2004) - [c36]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: 89-101 - [c35]Denis Thérien:
Regular Languages, Unambiguous Concatenation and Computational Complexity. FSTTCS 2004: 49-57 - [c34]Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien:
Algebraic Results on Quantum Automata. STACS 2004: 93-104 - [i3]Ondrej Klíma, Pascal Tesson, Denis Thérien:
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j27]Patricia Bouyer, Antoine Petit, Denis Thérien:
An algebraic approach to data languages and timed languages. Inf. Comput. 182(2): 137-162 (2003) - [j26]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): 29-69 (2003) - [c33]Arkadev Chattopadhyay, Denis Thérien:
Locally Commutative Categories. ICALP 2003: 984-995 - [c32]Pascal Tesson, Denis Thérien:
Complete Classifications for the Communication Complexity of Regular Languages. STACS 2003: 62-73 - [c31]Ricard Gavaldà
Algebraic Characterizations of Small Classes of Boolean Functions. STACS 2003: 331-342 - 2002
- [j25]Pascal Tesson, Denis Thérien:
The Computing Power of Programs over Finite Monoids. J. Autom. Lang. Comb. 7(2): 247-258 (2002) - [c30]Howard Straubing, Denis Thérien:
Weakly Iterated Block Products of Finite Monoids. LATIN 2002: 91-104 - [c29]Denis Thérien, Thomas Wilke:
Nesting Until and Since in Linear Temporal Logic. STACS 2002: 455-464 - 2001
- [j24]Denis Thérien, Thomas Wilke:
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. SIAM J. Comput. 31(3): 777-798 (2001) - [c28]Patricia Bouyer, Antoine Petit, Denis Thérien:
An Algebraic Characterization of Data and Timed Languages. CONCUR 2001: 248-261 - [c27]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250 - [c26]David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien:
The Crane Beach Conjecture. LICS 2001: 187-196 - [c25]Cristopher Moore
Satisfiability of Systems of Equations over Finite Monoids. MFCS 2001: 537-547 - [c24]Martin Beaudry, François Lemieux, Denis Thérien:
Star-Free Open Languages and Aperiodic Loops. STACS 2001: 87-98 - [c23]Ricard Gavaldà
Learning Expressions over Monoids. STACS 2001: 283-293 - [c22]Howard Straubing, Denis Thérien:
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. STACS 2001: 551-562 - [i2]Pascal Tesson, Denis Thérien:
The Computing Power of Programs over Finite Monoids. Electron. Colloquium Comput. Complex. TR01 (2001) - [i1]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. TR01 (2001) - 2000
- [j23]Mikael Goldmann, Alexander Russell
An ergodic theorem for read-once non-uniform deterministic finite automata. Inf. Process. Lett. 73(1-2): 23-28 (2000) - [j22]Cristopher Moore
Circuits and Expressions with Nonassociative Gates. J. Comput. Syst. Sci. 60(2): 368-394 (2000) - [j21]Alexis Maciel, Pierre Péladeau, Denis Thérien:
Programs over semigroups of dot-depth one. Theor. Comput. Sci. 245(1): 135-148 (2000) - [c21]Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The Many Faces of a Translation. ICALP 2000: 890-901 - [c20]David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien:
Equation Satisfiability and Program Satisfiability for Finite Monoids. MFCS 2000: 172-181
1990 – 1999
- 1999
- [j20]Alexis Maciel, Denis Thérien:
Efficient Threshold Circuits for Power Series. Inf. Comput. 152(1): 62-73 (1999) - [c19]Augustin Baziramwabo, Pierre McKenzie, Denis Thérien:
Modular Temporal Logic. LICS 1999: 344-351 - 1998
- [j19]Alexis Maciel, Denis Thérien:
Threshold Circuits of Small Majority-Depth. Inf. Comput. 146(1): 55-83 (1998) - [j18]Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
Nondeterministic NC1 Computation. J. Comput. Syst. Sci. 57(2): 200-212 (1998) - [c18]Jean-François Raymond, Pascal Tesson, Denis Thérien:
An Algebraic Approach to Communication Complexity. ICALP 1998: 29-40 - [c17]Denis Thérien, Thomas Wilke:
Over Words, Two Variables Are as Powerful as One Quantifier Alternation. STOC 1998: 234-240 - 1997
- [j17]Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien:
Finite Moniods: From Word to Circuit Evaluation. SIAM J. Comput. 26(1): 138-152 (1997) - [j16]Pierre Péladeau, Howard Straubing, Denis Thérien:
Finite Semigroup Varieties Defined by Programs. Theor. Comput. Sci. 180(1-2): 325-339 (1997) - [c16]Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore
Circuits and Expressions with NOn-Associative Gates. CCC 1997: 193-203 - [c15]Martin Beaudry, François Lemieux, Denis Thérien:
Finite Loops Recognize Exactly the Regular Open Languages. ICALP 1997: 110-120 - 1996
- [j15]Birgit Jenner, Pierre McKenzie, Denis Thérien:
Logspace and Logtime Leaf Languages. Inf. Comput. 129(1): 21-33 (1996) - [c14]Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer:
Nondeterministic NC1 Computation. CCC 1996: 12-21 - [c13]Denis Thérien, Thomas Wilke:
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. FOCS 1996: 256-263 - 1995
- [j14]Howard Straubing, Denis Thérien, Wolfgang Thomas:
Regular Languages Defined with Generalized Quanifiers. Inf. Comput. 118(2): 289-301 (1995) - 1994
- [j13]Pierre McKenzie, Denis Thérien:
Special Issue on Circuit Complexity: Foreword. Comput. Complex. 4: 297-300 (1994) - [j12]Denis Thérien:
Circuits Constructed with Mod_q Gates Cannot Compute "And" in Sublinear Size. Comput. Complex. 4: 383-388 (1994) - [c12]Birgit Jenner, Pierre McKenzie, Denis Thérien:
Logspace and Logtime Leaf Languages. SCT 1994: 242-254 - [c11]Clemens Lautemann, Thomas Schwentick, Denis Thérien:
Logics For Context-Free Languages. CSL 1994: 205-216 - 1993
- [j11]Jean-Eric Pin, Denis Thérien:
The Bideterministic Concatenation Product. Int. J. Algebra Comput. 3(4): 535-556 (1993) - [c10]Alexis Maciel, Denis Thérien:
Threshold Circuits for Iterated Multiplication: Using AC0 for Free. STACS 1993: 545-565 - 1992
- [j10]Jean-Eric Pin, Howard Straubing, Denis Thérien:
Some Results on the Generalized Star-Height Problem. Inf. Comput. 101(2): 219-250 (1992) - [j9]Martin Beaudry, Pierre McKenzie, Denis Thérien:
The Membership Problem in Aperiodic Transformation Monoids. J. ACM 39(3): 599-616 (1992) - [j8]David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien:
Regular Languages in NC¹. J. Comput. Syst. Sci. 44(3): 478-499 (1992) - [c9]Denis Thérien:
Circuits Constructed with MODq Gates Cannot Compute AND in Sublinear Size. LATIN 1992: 498-502 - 1991
- [j7]Pierre McKenzie, Pierre Péladeau, Denis Thérien:
NC¹: The Automata-Theoretic Viewpoint. Comput. Complex. 1: 330-359 (1991) - 1990
- [j6]David A. Mix Barrington, Howard Straubing, Denis Thérien:
Non-Uniform Automata Over Groups. Inf. Comput. 89(2): 109-132 (1990)
1980 – 1989
- 1989
- [j5]Denis Thérien:
Programs over Aperiodic Monoids. Theor. Comput. Sci. 64(3): 271-280 (1989) - [c8]Pierre McKenzie, Denis Thérien:
Automata Theory Meets Circuit Complexity. ICALP 1989: 589-602 - [c7]Martin Beaudry, Pierre McKenzie, Denis Thérien:
Testing Membership: Beyond Permutation Groups (Extended Abstract). STACS 1989: 388-399 - [c6]Jean-Eric Pin, Howard Straubing, Denis Thérien:
New Results on the Generalized Star-Height Problem. STACS 1989: 458-467 - 1988
- [j4]Denis Thérien:
Categories Et Langages De Dot-Depth Un. RAIRO Theor. Informatics Appl. 22(4): 437-445 (1988) - [j3]David A. Mix Barrington, Denis Thérien:
Finite monoids and the fine structure of NC1. J. ACM 35(4): 941-952 (1988) - [c5]Howard Straubing, Denis Thérien, Wolfgang Thomas:
regular Languages Defined with Generalized Quantifiers. ICALP 1988: 561-575 - [c4]Howard Straubing, Denis Thérien:
Finite automata and computational complexity. Formal Properties of Finite Automata and Applications 1988: 199-233 - 1987
- [c3]David A. Mix Barrington, Denis Thérien:
Non-Uniform Automata Over Groups. ICALP 1987: 163-173 - [c2]David A. Mix Barrington, Denis Thérien:
Finite Monoids and the Fine Structure of NC¹. STOC 1987: 101-109 - 1986
- [j2]Alex Weiss, Denis Thérien:
Varieties of Finite Categories. RAIRO Theor. Informatics Appl. 20(3): 357-366 (1986) - 1981
- [j1]Denis Thérien:
Classification of Finite Monoids: The Language Approach. Theor. Comput. Sci. 14: 195-208 (1981)
1970 – 1979
- 1979
- [c1]Denis Thérien:
Languages of Nilpotent and Solvable Groups (Extended Abstract). ICALP 1979: 616-632
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: