Denis Thérien

103 papers A* 17A 15B 8C 2Misc 1Journal 49Unranked 9

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	From Machine Learning to Robotics: Challenges and Opportunities for Embodied Intelligence. CoRR 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
2014	J	`jnl`	Learning Read-Constant Polynomials of Constant Degree Modulo Composites. Theory Comput. Syst. Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien
2011	Misc	`conf`	Learning Read-Constant Polynomials of Constant Degree Modulo Composites. CSR Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien
2011	—	`conf`	The Power of Diversity. DCFS Denis Thérien
2010	—	`conf`	10061 Abstracts Collection - Circuits, Logic, and Games. Circuits, Logic, and Games Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2010	—	`conf`	10061 Executive Summary - Circuits, Logic, and Games. Circuits, Logic, and Games Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2010	—	`ed.`	Circuits, Logic, and Games, 07.02. - 12.02.2010 Circuits, Logic, and Games Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2010	J	`jnl`	Weakly Iterated Block Products and Applications to Logic and Complexity. Int. J. Algebra Comput. Howard Straubing, Pascal Tesson, Denis Thérien
2009	B	`conf`	An Algebraic Perspective on Boolean Function Learning. ALT Ricard Gavaldà, Denis Thérien
2008	—	`conf`	Modular quantifiers. Logic and Automata Howard Straubing, Denis Thérien
2007	—	`ed.`	Circuits, Logic, and Games, 08.11. - 10.11.2006 Circuits, Logic, and Games Thomas Schwentick, Denis Thérien, Heribert Vollmer
2007	J	`jnl`	Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. Theory Comput. Syst. Ondrej Klíma, Pascal Tesson, Denis Thérien
2007	A	`conf`	Languages with Bounded Multiparty Communication Complexity. STACS Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien
2007	J	`jnl`	Logic Meets Algebra: the Case of Regular Languages CoRR Pascal Tesson, Denis Thérien
2007	J	`jnl`	Logic Meets Algebra: the Case of Regular Languages. Log. Methods Comput. Sci. Pascal Tesson, Denis Thérien
2006	—	`conf`	06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games Thomas Schwentick, Denis Thérien, Heribert Vollmer
2006	—	`conf`	06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games Thomas Schwentick, Denis Thérien, Heribert Vollmer
2006	J	`jnl`	A Note on MOD Theory Comput. Syst. Howard Straubing, Denis Thérien
2006	J	`jnl`	Algebraic Results on Quantum Automata. Theory Comput. Syst. Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
2006	B	`conf`	An Algebraic Point of View on the Crane Beach Property. CSL Clemens Lautemann, Pascal Tesson, Denis Thérien
2006	J	`jnl`	Bridges between Algebraic Automata Theory and Complexity Theory. Bull. EATCS Pascal Tesson, Denis Thérien
2006	A	`conf`	Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. CCC Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien
2006	J	`jnl`	Languages with Bounded Multiparty Communication Complexity. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien
2006	J	`jnl`	Learning expressions and programs over monoids. Inf. Comput. Ricard Gavaldà, Pascal Tesson, Denis Thérien
2006	A*	`conf`	Lower bounds for circuits with MOD_m gates. FOCS Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien
2006	J	`jnl`	The many faces of a translation. J. Comput. Syst. Sci. Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2005	A*	`conf`	Bounded-depth circuits: separating wires from gates. STOC Michal Koucký, Pavel Pudlák, Denis Thérien
2005	J	`jnl`	Complete Classifications for the Communication Complexity of Regular Languages. Theory Comput. Syst. Pascal Tesson, Denis Thérien
2005	J	`jnl`	First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. J. Comput. Syst. Sci. David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
2005	A*	`conf`	Groupoids That Recognize Only Regular Languages. ICALP Martin Beaudry, François Lemieux, Denis Thérien
2005	J	`jnl`	Imre Simon: an exceptional graduate student. RAIRO Theor. Informatics Appl. Denis Thérien
2005	A*	`conf`	Restricted Two-Variable Sentences, Circuits and Communication Complexity. ICALP Pascal Tesson, Denis Thérien
2005	J	`jnl`	The dot-depth and the polynomial hierarchies correspond on the delta levels. Int. J. Found. Comput. Sci. Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
2005	J	`jnl`	Tractable Clones of Polynomials over Semigroups Electron. Colloquium Comput. Complex. Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
2005	A	`conf`	Tractable Clones of Polynomials over Semigroups. CP Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
2004	A	`conf`	Algebraic Results on Quantum Automata. STACS Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
2004	J	`jnl`	Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups Electron. Colloquium Comput. Complex. Ondrej Klíma, Pascal Tesson, Denis Thérien
2004	J	`jnl`	Monoids and Computations. Int. J. Algebra Comput. Pascal Tesson, Denis Thérien
2004	J	`jnl`	Nesting Until and Since in Linear Temporal Logic. Theory Comput. Syst. Denis Thérien, Thomas Wilke
2004	—	`conf`	Regular Languages, Unambiguous Concatenation and Computational Complexity. FSTTCS Denis Thérien
2004	C	`conf`	The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. Developments in Language Theory Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
2003	A	`conf`	Algebraic Characterizations of Small Classes of Boolean Functions. STACS Ricard Gavaldà, Denis Thérien
2003	J	`jnl`	An algebraic approach to data languages and timed languages. Inf. Comput. Patricia Bouyer, Antoine Petit, Denis Thérien
2003	A	`conf`	Complete Classifications for the Communication Complexity of Regular Languages. STACS Pascal Tesson, Denis Thérien
2003	A*	`conf`	Locally Commutative Categories. ICALP Arkadev Chattopadhyay, Denis Thérien
2003	J	`jnl`	Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. Theory Comput. Syst. Howard Straubing, Denis Thérien
2002	A	`conf`	Nesting Until and Since in Linear Temporal Logic. STACS Denis Thérien, Thomas Wilke
2002	J	`jnl`	The Computing Power of Programs over Finite Monoids. J. Autom. Lang. Comb. Pascal Tesson, Denis Thérien
2002	B	`conf`	Weakly Iterated Block Products of Finite Monoids. LATIN Howard Straubing, Denis Thérien
2001	B	`conf`	An Algebraic Characterization of Data and Timed Languages. CONCUR Patricia Bouyer, Antoine Petit, Denis Thérien
2001	A	`conf`	Learning Expressions over Monoids. STACS Ricard Gavaldà, Denis Thérien
2001	J	`jnl`	On the Languages Recognized by Nilpotent Groups (a translation of "Sur les Langages Reconnus par des Groupes Nilpotents") Electron. Colloquium Comput. Complex. Pierre Péladeau, Denis Thérien
2001	C	`conf`	Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory Thomas Schwentick, Denis Thérien, Heribert Vollmer
2001	A	`conf`	Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. STACS Howard Straubing, Denis Thérien
2001	B	`conf`	Satisfiability of Systems of Equations over Finite Monoids. MFCS Cristopher Moore, Pascal Tesson, Denis Thérien
2001	A	`conf`	Star-Free Open Languages and Aperiodic Loops. STACS Martin Beaudry, François Lemieux, Denis Thérien
2001	J	`jnl`	Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. SIAM J. Comput. Denis Thérien, Thomas Wilke
2001	J	`jnl`	The Computing Power of Programs over Finite Monoids Electron. Colloquium Comput. Complex. Pascal Tesson, Denis Thérien
2001	A*	`conf`	The Crane Beach Conjecture. LICS David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
2000	J	`jnl`	An ergodic theorem for read-once non-uniform deterministic finite automata. Inf. Process. Lett. Mikael Goldmann, Alexander Russell, Denis Thérien
2000	J	`jnl`	Circuits and Expressions with Nonassociative Gates. J. Comput. Syst. Sci. Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, Arthur Drisko
2000	B	`conf`	Equation Satisfiability and Program Satisfiability for Finite Monoids. MFCS David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien
2000	J	`jnl`	Programs over semigroups of dot-depth one. Theor. Comput. Sci. Alexis Maciel, Pierre Péladeau, Denis Thérien
2000	A*	`conf`	The Many Faces of a Translation. ICALP Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
1999	J	`jnl`	Efficient Threshold Circuits for Power Series. Inf. Comput. Alexis Maciel, Denis Thérien
1999	A*	`conf`	Modular Temporal Logic. LICS Augustin Baziramwabo, Pierre McKenzie, Denis Thérien
1998	A*	`conf`	An Algebraic Approach to Communication Complexity. ICALP Jean-François Raymond, Pascal Tesson, Denis Thérien
1998	J	`jnl`	Nondeterministic J. Comput. Syst. Sci. Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
1998	A*	`conf`	Over Words, Two Variables Are as Powerful as One Quantifier Alternation. STOC Denis Thérien, Thomas Wilke
1998	J	`jnl`	Threshold Circuits of Small Majority-Depth. Inf. Comput. Alexis Maciel, Denis Thérien
1997	A	`conf`	Circuits and Expressions with NOn-Associative Gates. CCC Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien
1997	A*	`conf`	Finite Loops Recognize Exactly the Regular Open Languages. ICALP Martin Beaudry, François Lemieux, Denis Thérien
1997	J	`jnl`	Finite Moniods: From Word to Circuit Evaluation. SIAM J. Comput. Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien
1997	J	`jnl`	Finite Semigroup Varieties Defined by Programs. Theor. Comput. Sci. Pierre Péladeau, Howard Straubing, Denis Thérien
1996	J	`jnl`	Logspace and Logtime Leaf Languages. Inf. Comput. Birgit Jenner, Pierre McKenzie, Denis Thérien
1996	A	`conf`	Nondeterministic NC CCC Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
1996	A*	`conf`	Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. FOCS Denis Thérien, Thomas Wilke
1995	J	`jnl`	Regular Languages Defined with Generalized Quanifiers Inf. Comput. Howard Straubing, Denis Thérien, Wolfgang Thomas
1994	J	`jnl`	Circuits Constructed with Mod_q Gates Cannot Compute "And" in Sublinear Size. Comput. Complex. Denis Thérien
1994	B	`conf`	Logics For Context-Free Languages. CSL Clemens Lautemann, Thomas Schwentick, Denis Thérien
1994	—	`conf`	Logspace and Logtime Leaf Languages. SCT Birgit Jenner, Pierre McKenzie, Denis Thérien
1994	J	`jnl`	Special Issue on Circuit Complexity: Foreword. Comput. Complex. Pierre McKenzie, Denis Thérien
1993	J	`jnl`	The Bideterministic Concatenation Product. Int. J. Algebra Comput. Jean-Eric Pin, Denis Thérien
1993	A	`conf`	Threshold Circuits for Iterated Multiplication: Using AC0 for Free. STACS Alexis Maciel, Denis Thérien
1992	B	`conf`	Circuits Constructed with LATIN Denis Thérien
1992	J	`jnl`	Regular Languages in NC¹. J. Comput. Syst. Sci. David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien
1992	J	`jnl`	Some Results on the Generalized Star-Height Problem Inf. Comput. Jean-Eric Pin, Howard Straubing, Denis Thérien
1992	J	`jnl`	The Membership Problem in Aperiodic Transformation Monoids. J. ACM Martin Beaudry, Pierre McKenzie, Denis Thérien
1991	J	`jnl`	NC¹: The Automata-Theoretic Viewpoint. Comput. Complex. Pierre McKenzie, Pierre Péladeau, Denis Thérien
1990	J	`jnl`	Non-Uniform Automata Over Groups Inf. Comput. David A. Mix Barrington, Howard Straubing, Denis Thérien
1989	A*	`conf`	Automata Theory Meets Circuit Complexity. ICALP Pierre McKenzie, Denis Thérien
1989	A	`conf`	New Results on the Generalized Star-Height Problem. STACS Jean-Eric Pin, Howard Straubing, Denis Thérien
1989	J	`jnl`	Programs over Aperiodic Monoids. Theor. Comput. Sci. Denis Thérien
1989	A	`conf`	Testing Membership: Beyond Permutation Groups (Extended Abstract). STACS Martin Beaudry, Pierre McKenzie, Denis Thérien
1988	J	`jnl`	Categories Et Langages De Dot-Depth Un. RAIRO Theor. Informatics Appl. Denis Thérien
1988	—	`conf`	Finite automata and computational complexity. Formal Properties of Finite Automata and Applications Howard Straubing, Denis Thérien
1988	J	`jnl`	Finite monoids and the fine structure of NC J. ACM David A. Mix Barrington, Denis Thérien
1988	A*	`conf`	regular Languages Defined with Generalized Quantifiers. ICALP Howard Straubing, Denis Thérien, Wolfgang Thomas
1987	A*	`conf`	Finite Monoids and the Fine Structure of NC¹ STOC David A. Mix Barrington, Denis Thérien
1987	A*	`conf`	Non-Uniform Automata Over Groups. ICALP David A. Mix Barrington, Denis Thérien
1986	J	`jnl`	Varieties of Finite Categories. RAIRO Theor. Informatics Appl. Alex Weiss, Denis Thérien
1981	J	`jnl`	Classification of Finite Monoids: The Language Approach. Theor. Comput. Sci. Denis Thérien
1979	A*	`conf`	Languages of Nilpotent and Solvable Groups (Extended Abstract). ICALP Denis Thérien