Pascal Tesson

Publication Activity (10 Years)

Years Active: 1998-2014
Publications (10 Years): 0

Top Topics

Regular Languages

Pattern Matching

Statistical Queries

Top Venues

Theory Comput. Syst.

Publications

Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson
Conservative groupoids recognize only regular languages. Inf. Comput. 239 (2014)
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson
The Complexity of the List Homomorphism Problem for Graphs. Theory Comput. Syst. 51 (2) (2012)
Danny Dubé, Mario Latendresse, Pascal Tesson
Conservative Groupoids Recognize Only Regular Languages. LATA (2012)
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson
The Complexity of the List Homomorphism Problem for Graphs. STACS (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)
Benoît Larose, Pascal Tesson
Universal algebra and hardness results for constraint satisfaction problems. Theor. Comput. Sci. 410 (18) (2009)
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson
The complexity of the list homomorphism problem for graphs CoRR (2009)
László Egri, Benoît Larose, Pascal Tesson
Directed st-Connectivity Is Not Expressible in Symmetric Datalog. ICALP (2) (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)
Benoît Larose, Pascal Tesson
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. ICALP (2007)
László Egri, Benoît Larose, Pascal Tesson
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. LICS (2007)
Benoît Larose, Pascal Tesson
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. Electron. Colloquium Comput. Complex. 14 (025) (2007)
László Egri, Benoît Larose, Pascal Tesson
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. Electron. Colloquium Comput. Complex. 14 (024) (2007)
Pascal Tesson, Denis Thérien
Logic Meets Algebra: the Case of Regular Languages CoRR (2007)
Ondrej Klíma, Benoît Larose, Pascal Tesson
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. MFCS (2006)
Clemens Lautemann, Pascal Tesson, Denis Thérien
An Algebraic Point of View on the Crane Beach Property. CSL (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)
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)
Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
Tractable Clones of Polynomials over Semigroups Electron. Colloquium Comput. Complex. (059) (2005)
Pascal Tesson, Denis Thérien
Complete Classifications for the Communication Complexity of Regular Languages. Theory Comput. Syst. 38 (2) (2005)
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)
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)
Pascal Tesson, Denis Thérien
Complete Classifications for the Communication Complexity of Regular Languages. STACS (2003)
Pascal Tesson, Denis Thérien
The Computing Power of Programs over Finite Monoids. J. Autom. Lang. Comb. 7 (2) (2002)
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)
David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien
Equation Satisfiability and Program Satisfiability for Finite Monoids. MFCS (2000)
Jean-François Raymond, Pascal Tesson, Denis Thérien
An Algebraic Approach to Communication Complexity. ICALP (1998)