default search action
Alexandr Kazda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c2]Libor Barto
, Silvia Butti
Algebraic Approach to Approximation. LICS 2024: 10:1-10:14 - [i12]Libor Barto, Silvia Butti, Alexandr Kazda, Caterina Viola, Stanislav Zivný:
Algebraic Approach to Approximation. CoRR abs/2401.15186 (2024) - 2022
- [j11]Alexandr Kazda
Local-global property for G-invariant terms. Int. J. Algebra Comput. 32(6): 1209-1231 (2022) - [j10]Alexandr Kazda
Small Promise CSPs that reduce to large CSPs. Log. Methods Comput. Sci. 18(3) (2022) - 2021
- [j9]Alexandr Kazda:
Deciding the Existence of QuasiWeak Near Unanimity Terms in Finite Algebras. J. Multiple Valued Log. Soft Comput. 36(4-5): 337-352 (2021) - [i11]Alexandr Kazda, Michael Kompatscher:
The local-global property for G-invariant terms. CoRR abs/2109.02065 (2021) - [i10]Alexandr Kazda, Peter Mayr, Dmitriy Zhuk:
Small PCSPs that reduce to large CSPs. CoRR abs/2109.07924 (2021) - 2020
- [j8]Alexandr Kazda
Deciding some Maltsev conditions in finite Idempotent Algebras. J. Symb. Log. 85(2): 539-562 (2020) - [i9]Alexandr Kazda:
Deciding the existence of quasi weak near unanimity terms in finite algebras. CoRR abs/2002.06083 (2020)
2010 – 2019
- 2019
- [j7]Alexandr Kazda
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. ACM Trans. Algorithms 15(2): 22:1-22:33 (2019) - [i8]Alexandr Kazda, Jakub Oprsal, Matt Valeriote
Deciding the existence of minority terms. CoRR abs/1901.00316 (2019) - [i7]Alexandr Kazda, Dmitriy Zhuk:
Existence of cube terms in finite finitely generated clones. CoRR abs/1901.04975 (2019) - 2018
- [j6]Alexandr Kazda
nnn-permutability and linear Datalog implies symmetric Datalog. Log. Methods Comput. Sci. 14(2) (2018) - 2017
- [c1]Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek:
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SODA 2017: 307-326 - [i6]Alexandr Kazda, Matt Valeriote
Deciding some Maltsev conditions in finite idempotent algebras. CoRR abs/1704.05928 (2017) - 2016
- [j5]Libor Barto
Deciding absorption. Int. J. Algebra Comput. 26(5): 1033-1060 (2016) - [i5]Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek:
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. CoRR abs/1602.03124 (2016) - 2015
- [i4]Alexandr Kazda:
$n$-permutability and linear Datalog implies symmetric Datalog. CoRR abs/1508.05766 (2015) - [i3]Libor Barto, Alexandr Kazda:
Deciding absorption. CoRR abs/1512.07009 (2015) - 2014
- [j4]Mark Kambites, Alexandr Kazda
The word problem for free adequate semigroups. Int. J. Algebra Comput. 24(6): 893-908 (2014) - 2013
- [j3]Alexandr Kazda:
Complexity of the homomorphism extension problem in the random case. Chic. J. Theor. Comput. Sci. 2013 (2013) - [i2]Mark Kambites, Alexandr Kazda:
The word problem for free adequate semigroups. CoRR abs/1311.7523 (2013) - 2011
- [j2]Alexandr Kazda
Maltsev digraphs have a majority polymorphism. Eur. J. Comb. 32(3): 390-397 (2011)
2000 – 2009
- 2009
- [i1]Jarkko Kari, Alexandr Kazda, Paula Steinby:
On Continuous Weighted Finite Automata. CoRR abs/0908.3784 (2009) - 2008
- [j1]Alexandr Kazda:
The Chain Relation in Sofic Subshifts. Fundam. Informaticae 84(3-4): 375-390 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 20:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: