Pascal Tesson

35 papers A* 4A 4B 4C 2Journal 20Unranked 1
YearRankTypeTitle / Venue / Authors
2014 J jnl
Conservative groupoids recognize only regular languages.
Inf. Comput.
Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson
2012 C conf
Conservative Groupoids Recognize Only Regular Languages.
LATA
Danny Dubé, Mario Latendresse, Pascal Tesson
2012 J jnl
The Complexity of the List Homomorphism Problem for Graphs.
Theory Comput. Syst.
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson
2010 A conf
The Complexity of the List Homomorphism Problem for Graphs.
STACS
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson
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 J jnl
The complexity of the list homomorphism problem for graphs
CoRR
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson
2009 J jnl
Universal algebra and hardness results for constraint satisfaction problems.
Theor. Comput. Sci.
Benoît Larose, Pascal Tesson
2008 — conf
Directed st-Connectivity Is Not Expressible in Symmetric Datalog.
ICALP (2)
László Egri, Benoît Larose, Pascal Tesson
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
2007 A* conf
Symmetric Datalog and Constraint Satisfaction Problems in Logspace.
LICS
László Egri, Benoît Larose, Pascal Tesson
2007 J jnl
Symmetric Datalog and Constraint Satisfaction Problems in Logspace.
Electron. Colloquium Comput. Complex.
László Egri, Benoît Larose, Pascal Tesson
2007 A* conf
Universal Algebra and Hardness Results for Constraint Satisfaction Problems.
ICALP
Benoît Larose, Pascal Tesson
2007 J jnl
Universal Algebra and Hardness Results for Constraint Satisfaction Problems.
Electron. Colloquium Comput. Complex.
Benoît Larose, Pascal Tesson
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 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 B conf
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.
MFCS
Ondrej Klíma, Benoît Larose, Pascal Tesson
2005 J jnl
Complete Classifications for the Communication Complexity of Regular Languages.
Theory Comput. Syst.
Pascal Tesson, 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 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 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
Complete Classifications for the Communication Complexity of Regular Languages.
STACS
Pascal Tesson, Denis Thérien
2002 J jnl
The Computing Power of Programs over Finite Monoids.
J. Autom. Lang. Comb.
Pascal Tesson, Denis Thérien
2001 B conf
Satisfiability of Systems of Equations over Finite Monoids.
MFCS
Cristopher Moore, Pascal Tesson, Denis Thérien
2001 J jnl
The Computing Power of Programs over Finite Monoids
Electron. Colloquium Comput. Complex.
Pascal Tesson, Denis Thérien
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
1998 A* conf
An Algebraic Approach to Communication Complexity.
ICALP
Jean-François Raymond, Pascal Tesson, Denis Thérien