The Chain Relation in Sofic Subshifts. - Alexandr Kazda (Fundam. Informaticae, 2008)

On Continuous Weighted Finite Automata - Jarkko Kari; Alexandr Kazda; Paula Steinby (CoRR, 2009)

Maltsev digraphs have a majority polymorphism. - Alexandr Kazda (Eur. J. Comb., 2011)

Complexity of the homomorphism extension problem in the random case. - Alexandr Kazda (Chic. J. Theor. Comput. Sci., 2013)

The word problem for free adequate semigroups. - Mark Kambites; Alexandr Kazda (Int. J. Algebra Comput., 2014)

$n$-permutability and linear Datalog implies symmetric Datalog. - Alexandr Kazda (CoRR, 2015)

Deciding absorption. - Libor Barto; Alexandr Kazda (Int. J. Algebra Comput., 2016)

nnn-permutability and linear Datalog implies symmetric Datalog. - Alexandr Kazda (Log. Methods Comput. Sci., 2018)

Deciding the existence of minority terms. - Alexandr Kazda; Jakub Oprsal; Matt Valeriote; Dmitriy Zhuk (CoRR, 2019)

Existence of cube terms in finite finitely generated clones. - Alexandr Kazda; Dmitriy Zhuk (CoRR, 2019)

Even Delta-Matroids and the Complexity of Planar Boolean CSPs. - Alexandr Kazda; Vladimir Kolmogorov; Michal Rolínek (ACM Trans. Algorithms, 2019)

Deciding the existence of quasi weak near unanimity terms in finite algebras. - Alexandr Kazda (CoRR, 2020)

Deciding some Maltsev conditions in finite Idempotent Algebras. - Alexandr Kazda; Matt Valeriote (J. Symb. Log., 2020)

Small PCSPs that reduce to large CSPs. - Alexandr Kazda; Peter Mayr 001; Dmitriy Zhuk (CoRR, 2021)

Deciding the Existence of QuasiWeak Near Unanimity Terms in Finite Algebras. - Alexandr Kazda (J. Multiple Valued Log. Soft Comput., 2021)

Local-global property for G-invariant terms. - Alexandr Kazda; Michael Kompatscher (Int. J. Algebra Comput., 2022)

Small Promise CSPs that reduce to large CSPs. - Alexandr Kazda; Peter Mayr 001; Dmitriy Zhuk (Log. Methods Comput. Sci., 2022)

Algebraic Approach to Approximation. - Libor Barto; Silvia Butti; Alexandr Kazda; Caterina Viola; Stanislav Zivný (LICS, 2024)