Pascal Tesson

According to our database, Pascal Tesson authored at least 24 papers between 1998 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Conservative groupoids recognize only regular languages.

Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson

Inf. Comput., 2014

2012

Conservative Groupoids Recognize Only Regular Languages.

Danny Dubé, Mario Latendresse, Pascal Tesson

Proceedings of the Language and Automata Theory and Applications, 2012

2010

Weakly Iterated Block Products and Applications to Logic and Complexity.

Howard Straubing, Pascal Tesson, Denis Thérien

Int. J. Algebra Comput., 2010

The Complexity of the List Homomorphism Problem for Graphs.

László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

2008

Directed st-Connectivity Is Not Expressible in Symmetric Datalog.

László Egri, Benoît Larose, Pascal Tesson

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups.

Ondrej Klíma, Pascal Tesson, Denis Thérien

Theory Comput. Syst., 2007

Logic Meets Algebra: the Case of Regular Languages.

Pascal Tesson, Denis Thérien

Log. Methods Comput. Sci., 2007

Languages with Bounded Multiparty Communication Complexity.

Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien

Proceedings of the STACS 2007, 2007

Symmetric Datalog and Constraint Satisfaction Problems in Logspace.

László Egri, Benoît Larose, Pascal Tesson

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Universal Algebra and Hardness Results for Constraint Satisfaction Problems.

Benoît Larose, Pascal Tesson

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Learning expressions and programs over monoids.

Ricard Gavaldà, Pascal Tesson, Denis Thérien

Inf. Comput., 2006

Bridges between Algebraic Automata Theory and Complexity Theory.

Pascal Tesson, Denis Thérien

Bull. EATCS, 2006

Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.

Ondrej Klíma, Benoît Larose, Pascal Tesson

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

An Algebraic Point of View on the Crane Beach Property.

Clemens Lautemann, Pascal Tesson, Denis Thérien

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

The dot-depth and the polynomial hierarchies correspond on the delta levels.

Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien

Int. J. Found. Comput. Sci., 2005

Restricted Two-Variable Sentences, Circuits and Communication Complexity.

Pascal Tesson, Denis Thérien

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Tractable Clones of Polynomials over Semigroups.

Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

Monoids and Computations.

Pascal Tesson, Denis Thérien

Int. J. Algebra Comput., 2004

The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels.

Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien

Proceedings of the Developments in Language Theory, 2004

2003

Complete Classifications for the Communication Complexity of Regular Languages.

Pascal Tesson, Denis Thérien

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2001

The Computing Power of Programs over Finite Monoids

Pascal Tesson, Denis Thérien

Electron. Colloquium Comput. Complex., 2001

Satisfiability of Systems of Equations over Finite Monoids.

Cristopher Moore, Pascal Tesson, Denis Thérien

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

Equation Satisfiability and Program Satisfiability for Finite Monoids.

David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1998

An Algebraic Approach to Communication Complexity.

Jean-François Raymond, Pascal Tesson, Denis Thérien

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998