|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 34 publication records. Showing 34 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson |
The Complexity of the List Homomorphism Problem for Graphs.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Dubé, Mario Latendresse, Pascal Tesson |
Conservative Groupoids Recognize Only Regular Languages. |
LATA |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Straubing, Pascal Tesson, Denis Thérien |
Weakly Iterated Block Products and Applications to Logic and Complexity. |
IJAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson |
The Complexity of the List Homomorphism Problem for Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, Pascal Tesson |
Universal algebra and hardness results for constraint satisfaction problems. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson |
The complexity of the list homomorphism problem for graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | László Egri, Benoit Larose, Pascal Tesson |
Directed st-Connectivity Is Not Expressible in Symmetric Datalog. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, Pascal Tesson |
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | László Egri, Benoit Larose, Pascal Tesson |
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Logic Meets Algebra: the Case of Regular Languages. |
Logical Methods in Computer Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Logic Meets Algebra: the Case of Regular Languages |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ondrej Klíma, Pascal Tesson, Denis Thérien |
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, Pascal Tesson |
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien |
Languages with Bounded Multiparty Communication Complexity. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | László Egri, Benoit Larose, Pascal Tesson |
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ricard Gavaldà, Pascal Tesson, Denis Thérien |
Learning expressions and programs over monoids. |
Inf. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Bridges between Algebraic Automata Theory and Complexity Theory. |
Bulletin of the EATCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ondrej Klíma, Benoit Larose, Pascal Tesson |
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Lautemann, Pascal Tesson, Denis Thérien |
An Algebraic Point of View on the Crane Beach Property. |
CSL |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien |
Tractable Clones of Polynomials over Semigroups |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Complete Classifications for the Communication Complexity of Regular Languages. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Restricted Two-Variable Sentences, Circuits and Communication Complexity. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien |
Tractable Clones of Polynomials over Semigroups. |
CP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Monoids and Computations. |
IJAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
Complete Classifications for the Communication Complexity of Regular Languages. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
The Computing Power of Programs over Finite Monoids. |
Journal of Automata, Languages and Combinatorics |
2002 |
DBLP BibTeX RDF |
|
| 1 | Pascal Tesson, Denis Thérien |
The Computing Power of Programs over Finite Monoids |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Cristopher Moore, Pascal Tesson, Denis Thérien |
Satisfiability of Systems of Equations over Finite Monoids. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien |
Equation Satisfiability and Program Satisfiability for Finite Monoids. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Raymond, Pascal Tesson, Denis Thérien |
An Algebraic Approach to Communication Complexity. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #34 of 34 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")