Alexandr Kazda

According to our database1, Alexandr Kazda authored at least 18 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Algebraic Approach to Approximation.
CoRR, 2024

2022
Small Promise CSPs that reduce to large CSPs.
Log. Methods Comput. Sci., 2022

Local-global property for G-invariant terms.
Int. J. Algebra Comput., 2022

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

Small PCSPs that reduce to large CSPs.
CoRR, 2021

2020
Deciding some Maltsev conditions in finite Idempotent Algebras.
J. Symb. Log., 2020

Deciding the existence of quasi weak near unanimity terms in finite algebras.
CoRR, 2020

2019
Even Delta-Matroids and the Complexity of Planar Boolean CSPs.
ACM Trans. Algorithms, 2019

Existence of cube terms in finite finitely generated clones.
CoRR, 2019

Deciding the existence of minority terms.
CoRR, 2019

2018
nnn-permutability and linear Datalog implies symmetric Datalog.
Log. Methods Comput. Sci., 2018

2016
Deciding absorption.
Int. J. Algebra Comput., 2016

2015
$n$-permutability and linear Datalog implies symmetric Datalog.
CoRR, 2015

2014
The word problem for free adequate semigroups.
Int. J. Algebra Comput., 2014

2013
Complexity of the homomorphism extension problem in the random case.
Chic. J. Theor. Comput. Sci., 2013

2011
Maltsev digraphs have a majority polymorphism.
Eur. J. Comb., 2011

2009
On Continuous Weighted Finite Automata
CoRR, 2009

2008
The Chain Relation in Sofic Subshifts.
Fundam. Informaticae, 2008


  Loading...