| Publication | Date of Publication | Type |
|---|
Conservative groupoids recognize only regular languages
Information and Computation | 2014-11-28 | Paper |
The complexity of the list homomorphism problem for graphs
Theory of Computing Systems | 2012-12-07 | Paper |
Conservative groupoids recognize only regular languages
Language and Automata Theory and Applications | 2012-06-08 | Paper |
| The complexity of the list homomorphism problem for graphs | 2012-01-23 | Paper |
Weakly iterated block products and applications to logic and complexity
International Journal of Algebra and Computation | 2010-05-25 | Paper |
| scientific article; zbMATH DE number 5605078 (Why is no real title available?) | 2009-09-19 | Paper |
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science | 2009-04-29 | Paper |
An Algebraic Point of View on the Crane Beach Property
Computer Science Logic | 2009-03-12 | Paper |
Tractable Clones of Polynomials over Semigroups
Principles and Practice of Constraint Programming - CP 2005 | 2008-09-09 | Paper |
Directed st-Connectivity Is Not Expressible in Symmetric Datalog
Automata, Languages and Programming | 2008-08-19 | Paper |
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
Automata, Languages and Programming | 2007-11-28 | Paper |
Logic Meets Algebra: the Case of Regular Languages
Logical Methods in Computer Science | 2007-10-11 | Paper |
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Languages with Bounded Multiparty Communication Complexity
STACS 2007 | 2007-09-03 | Paper |
Dichotomies in the complexity of solving systems of equations over finite semigroups
Theory of Computing Systems | 2007-03-12 | Paper |
Learning expressions and programs over monoids
Information and Computation | 2006-04-28 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
Complete classifications for the communication complexity of regular languages
Theory of Computing Systems | 2005-04-19 | Paper |
MONOIDS AND COMPUTATIONS
International Journal of Algebra and Computation | 2005-03-18 | Paper |
| scientific article; zbMATH DE number 1944133 (Why is no real title available?) | 2003-11-30 | Paper |
| scientific article; zbMATH DE number 1962802 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1916674 (Why is no real title available?) | 2003-05-26 | Paper |
| scientific article; zbMATH DE number 1834675 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1759404 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1419257 (Why is no real title available?) | 2000-03-21 | Paper |
| scientific article; zbMATH DE number 1223708 (Why is no real title available?) | 1999-03-30 | Paper |
