Pascal Tesson

2009
28	EE	Benoit Larose, Pascal Tesson: Universal algebra and hardness results for constraint satisfaction problems. Theor. Comput. Sci. 410(18): 1629-1647 (2009)
2008
27	EE	László Egri, Benoit Larose, Pascal Tesson: Directed st-Connectivity Is Not Expressible in Symmetric Datalog. ICALP (2) 2008: 172-183
2007
26	EE	Benoit Larose, Pascal Tesson: Universal Algebra and Hardness Results for Constraint Satisfaction Problems. ICALP 2007: 267-278
25	EE	László Egri, Benoit Larose, Pascal Tesson: Symmetric Datalog and Constraint Satisfaction Problems in Logspace. LICS 2007: 193-202
24	EE	Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien: Languages with Bounded Multiparty Communication Complexity. STACS 2007: 500-511
23	EE	Pascal Tesson, Denis Thérien: Logic Meets Algebra: the Case of Regular Languages CoRR abs/cs/0701154: (2007)
22	EE	László Egri, Benoit Larose, Pascal Tesson: Symmetric Datalog and Constraint Satisfaction Problems in Logspace. Electronic Colloquium on Computational Complexity (ECCC) 14(024): (2007)
21	EE	Benoit Larose, Pascal Tesson: Universal Algebra and Hardness Results for Constraint Satisfaction Problems. Electronic Colloquium on Computational Complexity (ECCC) 14(025): (2007)
20	EE	Pascal Tesson, Denis Thérien: Logic Meets Algebra: the Case of Regular Languages. Logical Methods in Computer Science 3(1): (2007)
19	EE	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): 263-297 (2007)
2006
18	EE	Clemens Lautemann, Pascal Tesson, Denis Thérien: An Algebraic Point of View on the Crane Beach Property. CSL 2006: 426-440
17	EE	Ondrej Klíma, Benoit Larose, Pascal Tesson: Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. MFCS 2006: 584-595
16	EE	Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien: Languages with Bounded Multiparty Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(117): (2006)
15	EE	Ricard Gavaldà, Pascal Tesson, Denis Thérien: Learning expressions and programs over monoids. Inf. Comput. 204(2): 177-209 (2006)
2005
14	EE	Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien: Tractable Clones of Polynomials over Semigroups. CP 2005: 196-210
13	EE	Pascal Tesson, Denis Thérien: Restricted Two-Variable Sentences, Circuits and Communication Complexity. ICALP 2005: 526-538
12	EE	Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien: Tractable Clones of Polynomials over Semigroups Electronic Colloquium on Computational Complexity (ECCC)(059): (2005)
11	EE	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): 625-644 (2005)
10	EE	Pascal Tesson, Denis Thérien: Complete Classifications for the Communication Complexity of Regular Languages. Theory Comput. Syst. 38(2): 135-159 (2005)
2004
9	EE	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: 89-101
8	EE	Ondrej Klíma, Pascal Tesson, Denis Thérien: Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups Electronic Colloquium on Computational Complexity (ECCC)(091): (2004)
7	EE	Pascal Tesson, Denis Thérien: Monoids and Computations. IJAC 14(5-6): 801-816 (2004)
2003
6	EE	Pascal Tesson, Denis Thérien: Complete Classifications for the Communication Complexity of Regular Languages. STACS 2003: 62-73
2002
5		Pascal Tesson, Denis Thérien: The Computing Power of Programs over Finite Monoids. Journal of Automata, Languages and Combinatorics 7(2): 247-258 (2002)
2001
4	EE	Cristopher Moore, Pascal Tesson, Denis Thérien: Satisfiability of Systems of Equations over Finite Monoids. MFCS 2001: 537-547
3	EE	Pascal Tesson, Denis Thérien: The Computing Power of Programs over Finite Monoids Electronic Colloquium on Computational Complexity (ECCC) 8(5): (2001)
2000
2	EE	David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien: Equation Satisfiability and Program Satisfiability for Finite Monoids. MFCS 2000: 172-181
1998
1	EE	Jean-François Raymond, Pascal Tesson, Denis Thérien: An Algebraic Approach to Communication Complexity. ICALP 1998: 29-40

Coauthor Index

1	David A. Mix Barrington	[2]
2	Bernd Borchert	[9] [11]
3	Arkadev Chattopadhyay	[16] [24]
4	Víctor Dalmau	[12] [14]
5	László Egri	[22] [25] [27]
6	Ricard Gavaldà	[12] [14] [15]
7	Ondrej Klíma	[8] [17] [19]
8	Michal Koucký	[16] [24]
9	Andreas Krebs	[16] [24]
10	Klaus-Jörn Lange	[9] [11]
11	Benoit Larose	[17] [21] [22] [25] [26] [27] [28]
12	Clemens Lautemann	[18]
13	Pierre McKenzie	[2]
14	Cristopher Moore	[2] [4]
15	Jean-François Raymond	[1]
16	Frank Stephan	[9] [11]
17	Mario Szegedy	[16] [24]
18	Denis Thérien	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [18] [19] [20] [23] [24]