default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascal Tesson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j12]Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson:
Conservative groupoids recognize only regular languages. Inf. Comput. 239: 13-28 (2014)- 2012
- [j11]László Egri, Andrei A. Krokhin
, Benoît 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. Int. J. Algebra Comput. 20(2): 319-341 (2010) - [c14]László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson:
The Complexity of the List Homomorphism Problem for Graphs. STACS 2010: 335-346
2000 – 2009
- 2009
- [j9]Benoît 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, Benoît Larose, Pascal Tesson:
The complexity of the list homomorphism problem for graphs. CoRR abs/0912.3802 (2009) - 2008
- [c13]László Egri, Benoît 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. Log. Methods Comput. Sci. 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]Benoît Larose, Pascal Tesson:
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. ICALP 2007: 267-278 - [c11]László Egri, Benoît 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, Benoît Larose, Pascal Tesson:
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. Electron. Colloquium Comput. Complex. TR07 (2007) - [i5]Benoît Larose, Pascal Tesson:
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j6]Pascal Tesson, Denis Thérien:
Bridges between Algebraic Automata Theory and Complexity Theory. Bull. 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, Benoît 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. Electron. Colloquium Comput. Complex. TR06 (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. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j2]Pascal Tesson, Denis Thérien:
Monoids and Computations. Int. J. Algebra Comput. 14(5-6): 801-816 (2004) - [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. Electron. Colloquium Comput. Complex. TR04 (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. J. Autom. Lang. Comb. 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. Electron. Colloquium Comput. Complex. TR01 (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
1990 – 1999
- 1998
- [c1]Jean-François Raymond, Pascal Tesson, Denis Thérien:
An Algebraic Approach to Communication Complexity. ICALP 1998: 29-40
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
