The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Pascal Tesson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  23. Directed st-Connectivity Is Not Expressible in Symmetric Datalog. [Citation Graph (, )][DBLP]


  24. The Complexity of the List Homomorphism Problem for Graphs. [Citation Graph (, )][DBLP]


  25. The complexity of the list homomorphism problem for graphs [Citation Graph (, )][DBLP]


  26. Symmetric Datalog and Constraint Satisfaction Problems in Logspace. [Citation Graph (, )][DBLP]


  27. Universal Algebra and Hardness Results for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  28. Languages with Bounded Multiparty Communication Complexity. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.154secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002