Denis Thérien

According to our database1, Denis Thérien authored at least 100 papers between 1979 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2014
Learning Read-Constant Polynomials of Constant Degree Modulo Composites.
Theory Comput. Syst., 2014

2011
The Power of Diversity.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

Learning Read-Constant Polynomials of Constant Degree Modulo Composites.
Proceedings of the Computer Science - Theory and Applications, 2011

2010
Weakly Iterated Block Products and Applications to Logic and Complexity.
IJAC, 2010

10061 Executive Summary - Circuits, Logic, and Games.
Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

10061 Abstracts Collection - Circuits, Logic, and Games.
Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

2009
An Algebraic Perspective on Boolean Function Learning.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
Modular quantifiers.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups.
Theory Comput. Syst., 2007

Logic Meets Algebra: the Case of Regular Languages.
Logical Methods in Computer Science, 2007

Logic Meets Algebra: the Case of Regular Languages
CoRR, 2007

Languages with Bounded Multiparty Communication Complexity.
Proceedings of the STACS 2007, 2007

2006
A Note on MODp - MODm Circuits.
Theory Comput. Syst., 2006

Algebraic Results on Quantum Automata.
Theory Comput. Syst., 2006

The many faces of a translation.
J. Comput. Syst. Sci., 2006

Learning expressions and programs over monoids.
Inf. Comput., 2006

Languages with Bounded Multiparty Communication Complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Bridges between Algebraic Automata Theory and Complexity Theory.
Bulletin of the EATCS, 2006

Lower bounds for circuits with MOD_m gates.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

06451 Abstracts Collection -- Circuits, Logic, and Games .
Proceedings of the Circuits, Logic, and Games, 08.11. - 10.11.2006, 2006

06451 Executive Summary -- Circuits, Logic, and Games .
Proceedings of the Circuits, Logic, and Games, 08.11. - 10.11.2006, 2006

An Algebraic Point of View on the Crane Beach Property.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Circuit Lower Bounds via Ehrenfeucht-Fraisse Games.
Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006

2005
Complete Classifications for the Communication Complexity of Regular Languages.
Theory Comput. Syst., 2005

First-order expressibility of languages with neutral letters or: The Crane Beach conjecture.
J. Comput. Syst. Sci., 2005

Imre Simon: an exceptional graduate student.
ITA, 2005

The dot-depth and the polynomial hierarchies correspond on the delta levels.
Int. J. Found. Comput. Sci., 2005

Tractable Clones of Polynomials over Semigroups
Electronic Colloquium on Computational Complexity (ECCC), 2005

Bounded-depth circuits: separating wires from gates.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Restricted Two-Variable Sentences, Circuits and Communication Complexity.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Groupoids That Recognize Only Regular Languages.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Tractable Clones of Polynomials over Semigroups.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Nesting Until and Since in Linear Temporal Logic.
Theory Comput. Syst., 2004

Monoids and Computations.
IJAC, 2004

Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups
Electronic Colloquium on Computational Complexity (ECCC), 2004

Algebraic Results on Quantum Automata.
Proceedings of the STACS 2004, 2004

Regular Languages, Unambiguous Concatenation and Computational Complexity.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels.
Proceedings of the Developments in Language Theory, 2004

2003
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables.
Theory Comput. Syst., 2003

An algebraic approach to data languages and timed languages.
Inf. Comput., 2003

Complete Classifications for the Communication Complexity of Regular Languages.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Algebraic Characterizations of Small Classes of Boolean Functions.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Locally Commutative Categories.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
The Computing Power of Programs over Finite Monoids.
Journal of Automata, Languages and Combinatorics, 2002

Nesting Until and Since in Linear Temporal Logic.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Weakly Iterated Block Products of Finite Monoids.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy.
SIAM J. Comput., 2001

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

The Computing Power of Programs over Finite Monoids
Electronic Colloquium on Computational Complexity (ECCC), 2001

Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables.
Proceedings of the STACS 2001, 2001

Learning Expressions over Monoids.
Proceedings of the STACS 2001, 2001

Star-Free Open Languages and Aperiodic Loops.
Proceedings of the STACS 2001, 2001

Satisfiability of Systems of Equations over Finite Monoids.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

The Crane Beach Conjecture.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

Partially-Ordered Two-Way Automata: A New Characterization of DA.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

An Algebraic Characterization of Data and Timed Languages.
Proceedings of the CONCUR 2001, 2001

2000
Programs over semigroups of dot-depth one.
Theor. Comput. Sci., 2000

Circuits and Expressions with Nonassociative Gates.
J. Comput. Syst. Sci., 2000

An ergodic theorem for read-once non-uniform deterministic finite automata.
Inf. Process. Lett., 2000

Equation Satisfiability and Program Satisfiability for Finite Monoids.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

The Many Faces of a Translation.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Efficient Threshold Circuits for Power Series.
Inf. Comput., 1999

Modular Temporal Logic.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998
Nondeterministic NC1 Computation.
J. Comput. Syst. Sci., 1998

Threshold Circuits of Small Majority-Depth.
Inf. Comput., 1998

Over Words, Two Variables Are as Powerful as One Quantifier Alternation.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

An Algebraic Approach to Communication Complexity.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Finite Semigroup Varieties Defined by Programs.
Theor. Comput. Sci., 1997

Finite Moniods: From Word to Circuit Evaluation.
SIAM J. Comput., 1997

Finite Loops Recognize Exactly the Regular Open Languages.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Circuits and Expressions with NOn-Associative Gates.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996
Logspace and Logtime Leaf Languages.
Inf. Comput., 1996

Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Nondeterministic NC1 Computation.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
Regular Languages Defined with Generalized Quanifiers
Inf. Comput., May, 1995

1994
Circuits Constructed with Mod_q Gates Cannot Compute "And" in Sublinear Size.
Computational Complexity, 1994

Special Issue on Circuit Complexity: Foreword.
Computational Complexity, 1994

Logics For Context-Free Languages.
Proceedings of the Computer Science Logic, 8th International Workshop, 1994

Logspace and Logtime Leaf Languages.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993
The Bideterministic Concatenation Product.
IJAC, 1993

Threshold Circuits for Iterated Multiplication: Using AC0 for Free.
Proceedings of the STACS 93, 1993

1992
Some Results on the Generalized Star-Height Problem
Inf. Comput., December, 1992

Regular Languages in NC¹.
J. Comput. Syst. Sci., 1992

The Membership Problem in Aperiodic Transformation Monoids.
J. ACM, 1992

Circuits Constructed with MODq Gates Cannot Compute AND in Sublinear Size.
Proceedings of the LATIN '92, 1992

1991
NC¹: The Automata-Theoretic Viewpoint.
Computational Complexity, 1991

1990
Non-Uniform Automata Over Groups
Inf. Comput., December, 1990

1989
Programs over Aperiodic Monoids.
Theor. Comput. Sci., 1989

New Results on the Generalized Star-Height Problem.
Proceedings of the STACS 89, 1989

Testing Membership: Beyond Permutation Groups (Extended Abstract).
Proceedings of the STACS 89, 1989

Automata Theory Meets Circuit Complexity.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988
Finite monoids and the fine structure of NC1.
J. ACM, 1988

Categories Et Langages De Dot-Depth Un.
ITA, 1988

Finite automata and computational complexity.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988

regular Languages Defined with Generalized Quantifiers.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
Finite Monoids and the Fine Structure of NC¹
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Non-Uniform Automata Over Groups.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Varieties of Finite Categories.
ITA, 1986

1981
Classification of Finite Monoids: The Language Approach.
Theor. Comput. Sci., 1981

1979
Languages of Nilpotent and Solvable Groups (Extended Abstract).
Proceedings of the Automata, 1979


  Loading...