| 2008 |
|---|
| 9 | EE | Ondrej Klíma,
Libor Polák:
Hierarchies of Piecewise Testable Languages.
Developments in Language Theory 2008: 479-490 |
| 8 | EE | Ondrej Klíma,
Libor Polák:
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups.
LATA 2008: 299-310 |
| 7 | EE | Ondrej Klíma,
Libor Polák:
On varieties of meet automata.
Theor. Comput. Sci. 407(1-3): 278-289 (2008) |
| 2007 |
|---|
| 6 | EE | 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) |
| 2006 |
|---|
| 5 | EE | Ondrej Klíma,
Benoit Larose,
Pascal Tesson:
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.
MFCS 2006: 584-595 |
| 2004 |
|---|
| 4 | EE | 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)(091): (2004) |
| 2002 |
|---|
| 3 | EE | Ondrej Klíma:
Unification Modulo Associativity and Idempotency Is NP-complete.
MFCS 2002: 423-432 |
| 2000 |
|---|
| 2 | EE | Ondrej Klíma,
Jirí Srba:
Matching Modulo Associativity and Idempotency Is NP-Complete.
MFCS 2000: 456-466 |
| 1999 |
|---|
| 1 | EE | Ivana Cerná,
Ondrej Klíma,
Jirí Srba:
Pattern Equations and Equations with Stuttering.
SOFSEM 1999: 369-378 |
