default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Kozik
Person information
- affiliation: Jagiellonian University, Kraków, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Libor Barto, Zarathustra Brady, Andrei Bulatov
, Marcin Kozik, Dmitriy Zhuk:
Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras. TheoretiCS 3 (2024)- [c15]Demian Banakh, Marcin Kozik:
Injective hardness condition for PCSPs. LICS 2024: 8:1-8:10 - [c14]Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný:
1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. LICS 2024: 24:1-24:12 - [i12]Demian Banakh, Marcin Kozik:
Injective hardness condition for PCSPs. CoRR abs/2405.10774 (2024) - [i11]Manuel Bodirsky, Marcin Kozik, Florent R. Madelaine, Barnaby Martin, Michal Wrona:
Model-checking positive equality free logic on a fixed structure (direttissima). CoRR abs/2408.13840 (2024) - 2023
- [c13]Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker:
Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing. LICS 2023: 1-13 - [i10]Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný:
On the complexity of the approximate hypergraph homomorphism problem. CoRR abs/2302.03456 (2023) - [i9]Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker:
Symmetries of structures that fail to interpret something finite. CoRR abs/2302.12112 (2023) - 2022
- [c12]Libor Barto, Marcin Kozik:
Combinatorial Gap Theorem and Reductions between Promise CSPs. SODA 2022: 1204-1220 - 2021
- [j11]Marcin Kozik:
Solving CSPs Using Weak Local Consistency. SIAM J. Comput. 50(4): 1263-1286 (2021) - [c11]Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk:
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP. LICS 2021: 1-13 - [i8]Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk:
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP. CoRR abs/2104.11808 (2021) - [i7]Libor Barto, Marcin Kozik:
Combinatorial Gap Theorem and Reductions between Promise CSPs. CoRR abs/2107.09423 (2021) - 2020
- [c10]Libor Barto, Marcin Kozik, Johnson Tan, Matt Valeriote:
Sensitive Instances of the Constraint Satisfaction Problem. ICALP 2020: 110:1-110:18 - [i6]Libor Barto, Marcin Kozik, Johnson Tan, Matt Valeriote:
Sensitive instances of the Constraint Satisfaction Problem. CoRR abs/2005.00266 (2020)
2010 – 2019
- 2019
- [j10]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs. SIAM J. Comput. 48(6): 1763-1795 (2019) - [c9]Miron Ficak, Marcin Kozik, Miroslav Olsák, Szymon Stankiewicz:
Dichotomy for Symmetric Boolean PCSPs. ICALP 2019: 57:1-57:12 - [i5]Miron Ficak, Marcin Kozik, Miroslav Olsák, Szymon Stankiewicz:
Dichotomy for symmetric Boolean PCSPs. CoRR abs/1904.12424 (2019) - 2017
- [c8]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust algorithms with polynomial loss for near-unanimity CSPs. SODA 2017: 340-357 - [p1]Libor Barto, Marcin Kozik:
Absorption in Universal Algebra and CSP. The Constraint Satisfaction Problem 2017: 45-77 - 2016
- [j9]Andrei Bulatov, Marcin Kozik, Peter Mayr, Markus Steindl:
The subpower membership problem for semigroups. Int. J. Algebra Comput. 26(7): 1435-1451 (2016) - [j8]Libor Barto, Marcin Kozik:
Robustly Solvable Constraint Satisfaction Problems. SIAM J. Comput. 45(4): 1646-1669 (2016) - [c7]Marcin Kozik:
Weak consistency notions for all the CSPs of bounded width. LICS 2016: 633-641 - [i4]Marcin Kozik:
Weaker consistency notions for all the CSPs of bounded width. CoRR abs/1605.00565 (2016) - [i3]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust algorithms with polynomial loss for near-unanimity CSPs. CoRR abs/1607.04787 (2016) - 2015
- [c6]Marcin Kozik, Joanna Ochremiak:
Algebraic Properties of Valued Constraint Satisfaction Problem. ICALP (1) 2015: 846-858 - [i2]Libor Barto, Marcin Kozik:
Robustly Solvable Constraint Satisfaction Problems. CoRR abs/1512.01157 (2015) - 2014
- [j7]Libor Barto, Marcin Kozik:
Constraint Satisfaction Problems Solvable by Local Consistency Methods. J. ACM 61(1): 3:1-3:19 (2014) - 2012
- [j6]Libor Barto, Marcin Kozik:
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem. Log. Methods Comput. Sci. 8(1) (2012) - [c5]Libor Barto, Marcin Kozik, Ross Willard:
Near Unanimity Constraints Have Bounded Pathwidth Duality. LICS 2012: 125-134 - [c4]Libor Barto, Marcin Kozik:
Robust satisfiability of constraint satisfaction problems. STOC 2012: 931-940 - 2011
- [i1]Libor Barto, Marcin Kozik:
Robust Satisfiability of Constraint Satisfaction Problems. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c3]Libor Barto, Marcin Kozik:
New Conditions for Taylor Varieties and CSP. LICS 2010: 100-109
2000 – 2009
- 2009
- [j5]Libor Barto, Marcin Kozik, Todd Niven:
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell). SIAM J. Comput. 38(5): 1782-1802 (2009) - [j4]Marcin Kozik:
A 2EXPTIME Complete Varietal Membership Problem. SIAM J. Comput. 38(6): 2443-2467 (2009) - [j3]Libor Barto, Marcin Kozik:
Congruence Distributivity Implies Bounded Width. SIAM J. Comput. 39(4): 1531-1542 (2009) - [c2]Libor Barto, Marcin Kozik:
Constraint Satisfaction Problems of Bounded Width. FOCS 2009: 595-603 - 2008
- [j2]Marcin Kozik:
A finite set of functions with an EXPTIME-complete composition problem. Theor. Comput. Sci. 407(1-3): 330-341 (2008) - [c1]Libor Barto, Marcin Kozik, Todd Niven:
Graphs, polymorphisms and the complexity of homomorphism problems. STOC 2008: 789-796 - 2007
- [j1]Marcin Kozik:
Computationally and Algebraically Complex Finite Algebra Membership Problems. Int. J. Algebra Comput. 17(8): 1635-1666 (2007)
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-09-30 01:02 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:
