- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j11 |      | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson: The Complexity of the List Homomorphism Problem for Graphs. Theory Comput. Syst. 51(2): 143-178 (2012) |
| c15 | | Danny Dubé, Mario Latendresse, Pascal Tesson: Conservative Groupoids Recognize Only Regular Languages. LATA 2012: 216-227 |
| 2010 | ||
| j10 | | Howard Straubing, Pascal Tesson, Denis Thérien: Weakly Iterated Block Products and Applications to Logic and Complexity. IJAC 20(2): 319-341 (2010) |
| c14 | | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson: The Complexity of the List Homomorphism Problem for Graphs. STACS 2010: 335-346 |
| 2009 | ||
| j9 | | Benoit Larose, Pascal Tesson: Universal algebra and hardness results for constraint satisfaction problems. Theor. Comput. Sci. 410(18): 1629-1647 (2009) |
| i8 | | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson: The complexity of the list homomorphism problem for graphs. CoRR abs/0912.3802 (2009) |
| 2008 | ||
| c13 | | László Egri, Benoit Larose, Pascal Tesson: Directed st-Connectivity Is Not Expressible in Symmetric Datalog. ICALP (2) 2008: 172-183 |
| 2007 | ||
| j8 | | Pascal Tesson, Denis Thérien: Logic Meets Algebra: the Case of Regular Languages. Logical Methods in Computer Science 3(1) (2007) |
| j7 | | 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) |
| c12 | | Benoit Larose, Pascal Tesson: Universal Algebra and Hardness Results for Constraint Satisfaction Problems. ICALP 2007: 267-278 |
| c11 | | László Egri, Benoit Larose, Pascal Tesson: Symmetric Datalog and Constraint Satisfaction Problems in Logspace. LICS 2007: 193-202 |
| c10 | | Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien: Languages with Bounded Multiparty Communication Complexity. STACS 2007: 500-511 |
| i7 | | Pascal Tesson, Denis Thérien: Logic Meets Algebra: the Case of Regular Languages. CoRR abs/cs/0701154 (2007) |
| i6 | | László Egri, Benoit Larose, Pascal Tesson: Symmetric Datalog and Constraint Satisfaction Problems in Logspace. Electronic Colloquium on Computational Complexity (ECCC) 14(024) (2007) |
| i5 | | Benoit Larose, Pascal Tesson: Universal Algebra and Hardness Results for Constraint Satisfaction Problems. Electronic Colloquium on Computational Complexity (ECCC) 14(025) (2007) |
| 2006 | ||
| j6 |  | Pascal Tesson, Denis Thérien: Bridges between Algebraic Automata Theory and Complexity Theory. Bulletin of the EATCS 88: 37-64 (2006) |
| j5 | | Ricard Gavaldà, Pascal Tesson, Denis Thérien: Learning expressions and programs over monoids. Inf. Comput. 204(2): 177-209 (2006) |
| c9 | | Clemens Lautemann, Pascal Tesson, Denis Thérien: An Algebraic Point of View on the Crane Beach Property. CSL 2006: 426-440 |
| c8 | | Ondrej Klíma, Benoit Larose, Pascal Tesson: Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. MFCS 2006: 584-595 |
| i4 | | 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) |
| 2005 | ||
| j4 | | 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) |
| j3 | | Pascal Tesson, Denis Thérien: Complete Classifications for the Communication Complexity of Regular Languages. Theory Comput. Syst. 38(2): 135-159 (2005) |
| c7 | | Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien: Tractable Clones of Polynomials over Semigroups. CP 2005: 196-210 |
| c6 | | Pascal Tesson, Denis Thérien: Restricted Two-Variable Sentences, Circuits and Communication Complexity. ICALP 2005: 526-538 |
| i3 | | Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien: Tractable Clones of Polynomials over Semigroups. Electronic Colloquium on Computational Complexity (ECCC)(059) (2005) |
| 2004 | ||
| j2 | | |
| c5 | | 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 |
| i2 | | 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) |
| 2003 | ||
| c4 | | Pascal Tesson, Denis Thérien: Complete Classifications for the Communication Complexity of Regular Languages. STACS 2003: 62-73 |
| 2002 | ||
| j1 | | 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 | ||
| c3 | | Cristopher Moore, Pascal Tesson, Denis Thérien: Satisfiability of Systems of Equations over Finite Monoids. MFCS 2001: 537-547 |
| i1 | | Pascal Tesson, Denis Thérien: The Computing Power of Programs over Finite Monoids. Electronic Colloquium on Computational Complexity (ECCC) 8(5) (2001) |
| 2000 | ||
| c2 | | 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 | ||
| c1 | | Jean-François Raymond, Pascal Tesson, Denis Thérien: An Algebraic Approach to Communication Complexity. ICALP 1998: 29-40 |
Colors in the list of coauthors
Last update Sat May 18 15:23:59 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page