( en | de | ru )

 

Disambiguation of "Tesson, Pascal"

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of the List Homomorphism Problem for Graphs.

, , , and . STACS, volume 5 of LIPIcs, page 335-346. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stephane Tesson

Julien Tesson

Pascal Häller

Pascal Bastian

Pascal Bihler

 

Other publications of authors with the same name

Logic Meets Algebra: the Case of Regular Languages., and . Logical Methods in Computer Science, (2007)Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture., , and . MFCS, volume 4162 of Lecture Notes in Computer Science, page 584-595. Springer, (2006)Symmetric Datalog and Constraint Satisfaction Problems in Logspace., , and . LICS, page 193-202. IEEE Computer Society, (2007)An Algebraic Approach to Communication Complexity., , and . ICALP, volume 1443 of Lecture Notes in Computer Science, page 29-40. Springer, (1998)An Algebraic Point of View on the Crane Beach Property., , and . CSL, volume 4207 of Lecture Notes in Computer Science, page 426-440. Springer, (2006)Directed st-Connectivity Is Not Expressible in Symmetric Datalog., , and . ICALP (2), volume 5126 of Lecture Notes in Computer Science, page 172-183. Springer, (2008)Satisfiability of Systems of Equations over Finite Monoids., , and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 537-547. Springer, (2001)Restricted Two-Variable Sentences, Circuits and Communication Complexity., and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 526-538. Springer, (2005)The Complexity of the List Homomorphism Problem for Graphs., , , and . STACS, volume 5 of LIPIcs, page 335-346. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Universal algebra and hardness results for constraint satisfaction problems., and . Theor. Comput. Sci., 410 (18): 1629-1647 (2009)