| Diamonds are forever: The variety DA P Tesson, D Thérien Semigroups, algorithms, automata and languages, 475-499, 2002 | 120 | 2002 |
| Universal algebra and hardness results for constraint satisfaction problems B Larose, P Tesson Theoretical Computer Science 410 (18), 1629-1647, 2009 | 76 | 2009 |
| Computational complexity questions related to finite monoids and semigroups P Tesson McGill University, 2003 | 53 | 2003 |
| Logic meets algebra: the case of regular languages P Tesson, D Thérien Logical Methods in Computer Science 3, 2007 | 47 | 2007 |
| Symmetric datalog and constraint satisfaction problems in logspace L Egri, B Larose, P Tesson 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 193-202, 2007 | 44 | 2007 |
| Dichotomies in the complexity of solving systems of equations over finite semigroups O Klíma, P Tesson, D Thérien Theory of Computing Systems 40, 263-297, 2007 | 40 | 2007 |
| The complexity of the list homomorphism problem for graphs L Egri, A Krokhin, B Larose, P Tesson Theory of Computing Systems 51, 143-178, 2012 | 33 | 2012 |
| Equation satisfiability and program satisfiability for finite monoids DM Barrington, P McKenzie, C Moore, P Tesson, D Thérien International Symposium on Mathematical Foundations of Computer Science, 172-181, 2000 | 28 | 2000 |
| An algebraic approach to communication complexity JF Raymond, P Tesson, D Thérien Automata, Languages and Programming: 25th International Colloquium, ICALP'98 …, 1998 | 27 | 1998 |
| Universal algebra and hardness results for constraint satisfaction problems B Larose, P Tesson International Colloquium on Automata, Languages, and Programming, 267-278, 2007 | 22 | 2007 |
| Complete classifications for the communication complexity of regular languages P Tesson, D Thérien Theory of computing systems 38 (2), 135-159, 2005 | 20 | 2005 |
| Satisfiability of systems of equations over finite monoids C Moore, P Tesson, D Thérien Mathematical Foundations of Computer Science 2001: 26th International …, 2001 | 18 | 2001 |
| Monoids and computations P Tesson, D Thérien International Journal of Algebra and Computation 14 (05n06), 801-816, 2004 | 17 | 2004 |
| Tractable clones of polynomials over semigroups V Dalmau, R Gavalda, P Tesson, D Thérien Principles and Practice of Constraint Programming-CP 2005: 11th …, 2005 | 13 | 2005 |
| Automata, Languages and Programming: 24th International Colloquium, ICALP'97, Bologna, Italy, July 7-11, 1997, Proceedings P Degano Springer Science & Business Media, 1997 | 13 | 1997 |
| Languages with bounded multiparty communication complexity A Chattopadhyay, A Krebs, M Koucký, M Szegedy, P Tesson, D Thérien Annual Symposium on Theoretical Aspects of Computer Science, 500-511, 2007 | 12 | 2007 |
| Restricted two-variable FO+ MOD sentences, circuits and communication complexity P Tesson, D Thérien International Colloquium on Automata, Languages, and Programming, 526-538, 2005 | 11 | 2005 |
| Complete classifications for the communication complexity of regular languages P Tesson, D Thérien Annual Symposium on Theoretical Aspects of Computer Science, 62-73, 2003 | 11 | 2003 |
| Diamonds are Forever: The Variety DA, Semigroups, Algorithms, Automata and Languages, Coimbra (Portugal) 2001 (Gracinda Maria dos Gomes Moreira da Cunha, Pedro Ventura Alves da … P Tesson, D Thérien World Scientific, 2002 | 11 | 2002 |
| The computing power of programs over finite monoids P Tesson, D Thérien Journal of Automata, Languages and Combinatorics 7 (2), 247-258, 2001 | 11 | 2001 |
