BibTeX records: Marcin Kozik

download as .bib file

@inproceedings{DBLP:conf/lics/BartoBKMP23,
  author       = {Libor Barto and
                  Bertalan Bodor and
                  Marcin Kozik and
                  Antoine Mottet and
                  Michael Pinsker},
  title        = {Symmetries of Graphs and Structures that Fail to Interpret a Finite
                  Thing},
  booktitle    = {{LICS}},
  pages        = {1--13},
  year         = {2023},
  url          = {https://doi.org/10.1109/LICS56636.2023.10175732},
  doi          = {10.1109/LICS56636.2023.10175732},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/BartoBKMP23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-03456,
  author       = {Lorenzo Ciardo and
                  Marcin Kozik and
                  Andrei A. Krokhin and
                  Tamio{-}Vesa Nakajima and
                  Stanislav Zivn{\'{y}}},
  title        = {On the complexity of the approximate hypergraph homomorphism problem},
  journal      = {CoRR},
  volume       = {abs/2302.03456},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2302.03456},
  doi          = {10.48550/ARXIV.2302.03456},
  eprinttype    = {arXiv},
  eprint       = {2302.03456},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2302-03456.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-12112,
  author       = {Libor Barto and
                  Bertalan Bodor and
                  Marcin Kozik and
                  Antoine Mottet and
                  Michael Pinsker},
  title        = {Symmetries of structures that fail to interpret something finite},
  journal      = {CoRR},
  volume       = {abs/2302.12112},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2302.12112},
  doi          = {10.48550/ARXIV.2302.12112},
  eprinttype    = {arXiv},
  eprint       = {2302.12112},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2302-12112.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BartoK22,
  author       = {Libor Barto and
                  Marcin Kozik},
  editor       = {Joseph (Seffi) Naor and
                  Niv Buchbinder},
  title        = {Combinatorial Gap Theorem and Reductions between Promise CSPs},
  booktitle    = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
                  12, 2022},
  pages        = {1204--1220},
  publisher    = {{SIAM}},
  year         = {2022},
  url          = {https://doi.org/10.1137/1.9781611977073.50},
  doi          = {10.1137/1.9781611977073.50},
  timestamp    = {Tue, 12 Apr 2022 11:24:56 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BartoK22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kozik21,
  author       = {Marcin Kozik},
  title        = {Solving CSPs Using Weak Local Consistency},
  journal      = {{SIAM} J. Comput.},
  volume       = {50},
  number       = {4},
  pages        = {1263--1286},
  year         = {2021},
  url          = {https://doi.org/10.1137/18M117577X},
  doi          = {10.1137/18M117577X},
  timestamp    = {Tue, 05 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Kozik21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BartoBBKZ21,
  author       = {Libor Barto and
                  Zarathustra Brady and
                  Andrei Bulatov and
                  Marcin Kozik and
                  Dmitriy Zhuk},
  title        = {Minimal Taylor Algebras as a Common Framework for the Three Algebraic
                  Approaches to the {CSP}},
  booktitle    = {36th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
                  2021, Rome, Italy, June 29 - July 2, 2021},
  pages        = {1--13},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/LICS52264.2021.9470557},
  doi          = {10.1109/LICS52264.2021.9470557},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/BartoBBKZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-11808,
  author       = {Libor Barto and
                  Zarathustra Brady and
                  Andrei Bulatov and
                  Marcin Kozik and
                  Dmitriy Zhuk},
  title        = {Minimal Taylor Algebras as a Common Framework for the Three Algebraic
                  Approaches to the {CSP}},
  journal      = {CoRR},
  volume       = {abs/2104.11808},
  year         = {2021},
  url          = {https://arxiv.org/abs/2104.11808},
  eprinttype    = {arXiv},
  eprint       = {2104.11808},
  timestamp    = {Mon, 03 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2104-11808.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-09423,
  author       = {Libor Barto and
                  Marcin Kozik},
  title        = {Combinatorial Gap Theorem and Reductions between Promise CSPs},
  journal      = {CoRR},
  volume       = {abs/2107.09423},
  year         = {2021},
  url          = {https://arxiv.org/abs/2107.09423},
  eprinttype    = {arXiv},
  eprint       = {2107.09423},
  timestamp    = {Thu, 29 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2107-09423.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BartoKTV20,
  author       = {Libor Barto and
                  Marcin Kozik and
                  Johnson Tan and
                  Matt Valeriote},
  editor       = {Artur Czumaj and
                  Anuj Dawar and
                  Emanuela Merelli},
  title        = {Sensitive Instances of the Constraint Satisfaction Problem},
  booktitle    = {47th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
                  Conference)},
  series       = {LIPIcs},
  volume       = {168},
  pages        = {110:1--110:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2020.110},
  doi          = {10.4230/LIPICS.ICALP.2020.110},
  timestamp    = {Thu, 16 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BartoKTV20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-00266,
  author       = {Libor Barto and
                  Marcin Kozik and
                  Johnson Tan and
                  Matt Valeriote},
  title        = {Sensitive instances of the Constraint Satisfaction Problem},
  journal      = {CoRR},
  volume       = {abs/2005.00266},
  year         = {2020},
  url          = {https://arxiv.org/abs/2005.00266},
  eprinttype    = {arXiv},
  eprint       = {2005.00266},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2005-00266.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DalmauKKMMO19,
  author       = {V{\'{\i}}ctor Dalmau and
                  Marcin Kozik and
                  Andrei A. Krokhin and
                  Konstantin Makarychev and
                  Yury Makarychev and
                  Jakub Oprsal},
  title        = {Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs},
  journal      = {{SIAM} J. Comput.},
  volume       = {48},
  number       = {6},
  pages        = {1763--1795},
  year         = {2019},
  url          = {https://doi.org/10.1137/18M1163932},
  doi          = {10.1137/18M1163932},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DalmauKKMMO19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FicakKOS19,
  author       = {Miron Ficak and
                  Marcin Kozik and
                  Miroslav Ols{\'{a}}k and
                  Szymon Stankiewicz},
  editor       = {Christel Baier and
                  Ioannis Chatzigiannakis and
                  Paola Flocchini and
                  Stefano Leonardi},
  title        = {Dichotomy for Symmetric Boolean PCSPs},
  booktitle    = {46th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2019, July 9-12, 2019, Patras, Greece},
  series       = {LIPIcs},
  volume       = {132},
  pages        = {57:1--57:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2019.57},
  doi          = {10.4230/LIPICS.ICALP.2019.57},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/FicakKOS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-12424,
  author       = {Miron Ficak and
                  Marcin Kozik and
                  Miroslav Ols{\'{a}}k and
                  Szymon Stankiewicz},
  title        = {Dichotomy for symmetric Boolean PCSPs},
  journal      = {CoRR},
  volume       = {abs/1904.12424},
  year         = {2019},
  url          = {http://arxiv.org/abs/1904.12424},
  eprinttype    = {arXiv},
  eprint       = {1904.12424},
  timestamp    = {Sat, 23 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-12424.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DalmauKKMMO17,
  author       = {V{\'{\i}}ctor Dalmau and
                  Marcin Kozik and
                  Andrei A. Krokhin and
                  Konstantin Makarychev and
                  Yury Makarychev and
                  Jakub Oprsal},
  editor       = {Philip N. Klein},
  title        = {Robust algorithms with polynomial loss for near-unanimity CSPs},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  16-19},
  pages        = {340--357},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974782.22},
  doi          = {10.1137/1.9781611974782.22},
  timestamp    = {Tue, 02 Feb 2021 17:07:33 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/DalmauKKMMO17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/dagstuhl/BartoK17,
  author       = {Libor Barto and
                  Marcin Kozik},
  editor       = {Andrei A. Krokhin and
                  Stanislav Zivn{\'{y}}},
  title        = {Absorption in Universal Algebra and {CSP}},
  booktitle    = {The Constraint Satisfaction Problem: Complexity and Approximability},
  series       = {Dagstuhl Follow-Ups},
  volume       = {7},
  pages        = {45--77},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/DFU.Vol7.15301.2},
  doi          = {10.4230/DFU.VOL7.15301.2},
  timestamp    = {Mon, 03 Aug 2020 17:29:58 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/BartoK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijac/BulatovKMS16,
  author       = {Andrei Bulatov and
                  Marcin Kozik and
                  Peter Mayr and
                  Markus Steindl},
  title        = {The subpower membership problem for semigroups},
  journal      = {Int. J. Algebra Comput.},
  volume       = {26},
  number       = {7},
  pages        = {1435--1451},
  year         = {2016},
  url          = {https://doi.org/10.1142/S0218196716500612},
  doi          = {10.1142/S0218196716500612},
  timestamp    = {Wed, 13 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ijac/BulatovKMS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BartoK16,
  author       = {Libor Barto and
                  Marcin Kozik},
  title        = {Robustly Solvable Constraint Satisfaction Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {45},
  number       = {4},
  pages        = {1646--1669},
  year         = {2016},
  url          = {https://doi.org/10.1137/130915479},
  doi          = {10.1137/130915479},
  timestamp    = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BartoK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Kozik16,
  author       = {Marcin Kozik},
  editor       = {Martin Grohe and
                  Eric Koskinen and
                  Natarajan Shankar},
  title        = {Weak consistency notions for all the CSPs of bounded width},
  booktitle    = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer
                  Science, {LICS} '16, New York, NY, USA, July 5-8, 2016},
  pages        = {633--641},
  publisher    = {{ACM}},
  year         = {2016},
  url          = {https://doi.org/10.1145/2933575.2934510},
  doi          = {10.1145/2933575.2934510},
  timestamp    = {Wed, 11 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/lics/Kozik16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Kozik16,
  author       = {Marcin Kozik},
  title        = {Weaker consistency notions for all the CSPs of bounded width},
  journal      = {CoRR},
  volume       = {abs/1605.00565},
  year         = {2016},
  url          = {http://arxiv.org/abs/1605.00565},
  eprinttype    = {arXiv},
  eprint       = {1605.00565},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Kozik16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DalmauKKMMO16,
  author       = {V{\'{\i}}ctor Dalmau and
                  Marcin Kozik and
                  Andrei A. Krokhin and
                  Konstantin Makarychev and
                  Yury Makarychev and
                  Jakub Oprsal},
  title        = {Robust algorithms with polynomial loss for near-unanimity CSPs},
  journal      = {CoRR},
  volume       = {abs/1607.04787},
  year         = {2016},
  url          = {http://arxiv.org/abs/1607.04787},
  eprinttype    = {arXiv},
  eprint       = {1607.04787},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DalmauKKMMO16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KozikO15,
  author       = {Marcin Kozik and
                  Joanna Ochremiak},
  editor       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Kazuo Iwama and
                  Naoki Kobayashi and
                  Bettina Speckmann},
  title        = {Algebraic Properties of Valued Constraint Satisfaction Problem},
  booktitle    = {Automata, Languages, and Programming - 42nd International Colloquium,
                  {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9134},
  pages        = {846--858},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-47672-7\_69},
  doi          = {10.1007/978-3-662-47672-7\_69},
  timestamp    = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/KozikO15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BartoK15,
  author       = {Libor Barto and
                  Marcin Kozik},
  title        = {Robustly Solvable Constraint Satisfaction Problems},
  journal      = {CoRR},
  volume       = {abs/1512.01157},
  year         = {2015},
  url          = {http://arxiv.org/abs/1512.01157},
  eprinttype    = {arXiv},
  eprint       = {1512.01157},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BartoK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BartoK14,
  author       = {Libor Barto and
                  Marcin Kozik},
  title        = {Constraint Satisfaction Problems Solvable by Local Consistency Methods},
  journal      = {J. {ACM}},
  volume       = {61},
  number       = {1},
  pages        = {3:1--3:19},
  year         = {2014},
  url          = {https://doi.org/10.1145/2556646},
  doi          = {10.1145/2556646},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BartoK14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-0557,
  author       = {Libor Barto and
                  Marcin Kozik},
  title        = {Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction
                  Problem},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {8},
  number       = {1},
  year         = {2012},
  url          = {https://doi.org/10.2168/LMCS-8(1:7)2012},
  doi          = {10.2168/LMCS-8(1:7)2012},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1201-0557.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BartoKW12,
  author       = {Libor Barto and
                  Marcin Kozik and
                  Ross Willard},
  title        = {Near Unanimity Constraints Have Bounded Pathwidth Duality},
  booktitle    = {Proceedings of the 27th Annual {IEEE} Symposium on Logic in Computer
                  Science, {LICS} 2012, Dubrovnik, Croatia, June 25-28, 2012},
  pages        = {125--134},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/LICS.2012.24},
  doi          = {10.1109/LICS.2012.24},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/BartoKW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BartoK12,
  author       = {Libor Barto and
                  Marcin Kozik},
  editor       = {Howard J. Karloff and
                  Toniann Pitassi},
  title        = {Robust satisfiability of constraint satisfaction problems},
  booktitle    = {Proceedings of the 44th Symposium on Theory of Computing Conference,
                  {STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
  pages        = {931--940},
  publisher    = {{ACM}},
  year         = {2012},
  url          = {https://doi.org/10.1145/2213977.2214061},
  doi          = {10.1145/2213977.2214061},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BartoK12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BartoK11,
  author       = {Libor Barto and
                  Marcin Kozik},
  title        = {Robust Satisfiability of Constraint Satisfaction Problems},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR11-163}},
  year         = {2011},
  url          = {https://eccc.weizmann.ac.il/report/2011/163},
  eprinttype    = {ECCC},
  eprint       = {TR11-163},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/BartoK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BartoK10,
  author       = {Libor Barto and
                  Marcin Kozik},
  title        = {New Conditions for Taylor Varieties and {CSP}},
  booktitle    = {Proceedings of the 25th Annual {IEEE} Symposium on Logic in Computer
                  Science, {LICS} 2010, 11-14 July 2010, Edinburgh, United Kingdom},
  pages        = {100--109},
  publisher    = {{IEEE} Computer Society},
  year         = {2010},
  url          = {https://doi.org/10.1109/LICS.2010.34},
  doi          = {10.1109/LICS.2010.34},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/BartoK10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BartoKN09,
  author       = {Libor Barto and
                  Marcin Kozik and
                  Todd Niven},
  title        = {The {CSP} Dichotomy Holds for Digraphs with No Sources and No Sinks
                  {(A} Positive Answer to a Conjecture of Bang-Jensen and Hell)},
  journal      = {{SIAM} J. Comput.},
  volume       = {38},
  number       = {5},
  pages        = {1782--1802},
  year         = {2009},
  url          = {https://doi.org/10.1137/070708093},
  doi          = {10.1137/070708093},
  timestamp    = {Sun, 22 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BartoKN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kozik09,
  author       = {Marcin Kozik},
  title        = {A 2EXPTIME Complete Varietal Membership Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {38},
  number       = {6},
  pages        = {2443--2467},
  year         = {2009},
  url          = {https://doi.org/10.1137/070680801},
  doi          = {10.1137/070680801},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Kozik09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BartoK09,
  author       = {Libor Barto and
                  Marcin Kozik},
  title        = {Congruence Distributivity Implies Bounded Width},
  journal      = {{SIAM} J. Comput.},
  volume       = {39},
  number       = {4},
  pages        = {1531--1542},
  year         = {2009},
  url          = {https://doi.org/10.1137/080743238},
  doi          = {10.1137/080743238},
  timestamp    = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BartoK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BartoK09,
  author       = {Libor Barto and
                  Marcin Kozik},
  title        = {Constraint Satisfaction Problems of Bounded Width},
  booktitle    = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
  pages        = {595--603},
  publisher    = {{IEEE} Computer Society},
  year         = {2009},
  url          = {https://doi.org/10.1109/FOCS.2009.32},
  doi          = {10.1109/FOCS.2009.32},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BartoK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kozik08,
  author       = {Marcin Kozik},
  title        = {A finite set of functions with an EXPTIME-complete composition problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {407},
  number       = {1-3},
  pages        = {330--341},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.tcs.2008.06.057},
  doi          = {10.1016/J.TCS.2008.06.057},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Kozik08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BartoKN08,
  author       = {Libor Barto and
                  Marcin Kozik and
                  Todd Niven},
  editor       = {Cynthia Dwork},
  title        = {Graphs, polymorphisms and the complexity of homomorphism problems},
  booktitle    = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
                  Victoria, British Columbia, Canada, May 17-20, 2008},
  pages        = {789--796},
  publisher    = {{ACM}},
  year         = {2008},
  url          = {https://doi.org/10.1145/1374376.1374488},
  doi          = {10.1145/1374376.1374488},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BartoKN08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijac/Kozik07,
  author       = {Marcin Kozik},
  title        = {Computationally and Algebraically Complex Finite Algebra Membership
                  Problems},
  journal      = {Int. J. Algebra Comput.},
  volume       = {17},
  number       = {8},
  pages        = {1635--1666},
  year         = {2007},
  url          = {https://doi.org/10.1142/S0218196707004335},
  doi          = {10.1142/S0218196707004335},
  timestamp    = {Tue, 25 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijac/Kozik07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics