An Algebraic Approach to Communication Complexity. - Jean-François Raymond; Pascal Tesson; Denis Thérien (ICALP, 1998)

Equation Satisfiability and Program Satisfiability for Finite Monoids. - David A. Mix Barrington; Pierre McKenzie; Cristopher Moore; Pascal Tesson; Denis Thérien (MFCS, 2000)

Satisfiability of Systems of Equations over Finite Monoids. - Cristopher Moore; Pascal Tesson; Denis Thérien (MFCS, 2001)

The Computing Power of Programs over Finite Monoids - Pascal Tesson; Denis Thérien (Electron. Colloquium Comput. Complex., 2001)

The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. - Bernd Borchert; Klaus-Jörn Lange; Frank Stephan 001; Pascal Tesson; Denis Thérien (Developments in Language Theory, 2004)

Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups - Ondrej Klíma 001; Pascal Tesson; Denis Thérien (Electron. Colloquium Comput. Complex., 2004)

Monoids and Computations. - Pascal Tesson; Denis Thérien (Int. J. Algebra Comput., 2004)

Restricted Two-Variable Sentences, Circuits and Communication Complexity. - Pascal Tesson; Denis Thérien (ICALP, 2005)

Tractable Clones of Polynomials over Semigroups - Víctor Dalmau; Ricard Gavaldà; Pascal Tesson; Denis Thérien (Electron. Colloquium Comput. Complex., 2005)

The dot-depth and the polynomial hierarchies correspond on the delta levels. - Bernd Borchert; Klaus-Jörn Lange; Frank Stephan 001; Pascal Tesson; Denis Thérien (Int. J. Found. Comput. Sci., 2005)

Complete Classifications for the Communication Complexity of Regular Languages. - Pascal Tesson; Denis Thérien (Theory Comput. Syst., 2005)

An Algebraic Point of View on the Crane Beach Property. - Clemens Lautemann; Pascal Tesson; Denis Thérien (CSL, 2006)

Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. - Ondrej Klíma 001; Benoît Larose; Pascal Tesson (MFCS, 2006)

Bridges between Algebraic Automata Theory and Complexity Theory. - Pascal Tesson; Denis Thérien (Bull. EATCS, 2006)

Languages with Bounded Multiparty Communication Complexity. - Arkadev Chattopadhyay; Michal Koucký 001; Andreas Krebs; Mario Szegedy; Pascal Tesson; Denis Thérien (Electron. Colloquium Comput. Complex., 2006)

Learning expressions and programs over monoids. - Ricard Gavaldà; Pascal Tesson; Denis Thérien (Inf. Comput., 2006)

Symmetric Datalog and Constraint Satisfaction Problems in Logspace. - László Egri; Benoît Larose; Pascal Tesson (Electron. Colloquium Comput. Complex., 2007)

Logic Meets Algebra: the Case of Regular Languages. - Pascal Tesson; Denis Thérien (Log. Methods Comput. Sci., 2007)

Directed st-Connectivity Is Not Expressible in Symmetric Datalog. - László Egri; Benoît Larose; Pascal Tesson (ICALP (2), 2008)

Universal algebra and hardness results for constraint satisfaction problems. - Benoît Larose; Pascal Tesson (Theor. Comput. Sci., 2009)

Weakly Iterated Block Products and Applications to Logic and Complexity. - Howard Straubing; Pascal Tesson; Denis Thérien (Int. J. Algebra Comput., 2010)

Conservative Groupoids Recognize Only Regular Languages. - Danny Dubé; Mario Latendresse; Pascal Tesson (LATA, 2012)

The Complexity of the List Homomorphism Problem for Graphs. - László Egri; Andrei A. Krokhin; Benoît Larose; Pascal Tesson (Theory Comput. Syst., 2012)

Conservative groupoids recognize only regular languages. - Martin Beaudry; Danny Dubé; Maxime Dubé; Mario Latendresse; Pascal Tesson (Inf. Comput., 2014)