default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLibor Barto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]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)- [c21]Libor Barto
, Silvia Butti, Alexandr Kazda, Caterina Viola, Stanislav Zivný:
Algebraic Approach to Approximation. LICS 2024: 10:1-10:14 - [i21]Libor Barto, Silvia Butti, Alexandr Kazda, Caterina Viola, Stanislav Zivný:
Algebraic Approach to Approximation. CoRR abs/2401.15186 (2024) - [i20]Libor Barto, Silvia Butti, Víctor Dalmau:
The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems. CoRR abs/2401.16998 (2024) - [i19]Kristina Asimi, Libor Barto, Victor Dalmau:
The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side. CoRR abs/2402.06821 (2024) - 2023
- [c20]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 - [i18]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
- [c19]Kristina Asimi, Libor Barto, Silvia Butti:
Fixed-Template Promise Model Checking Problems. CP 2022: 2:1-2:17 - [c18]Libor Barto, Silvia Butti:
Weisfeiler-Leman Invariant Promise Valued CSPs. CP 2022: 4:1-4:17 - [c17]Libor Barto, Marcin Kozik:
Combinatorial Gap Theorem and Reductions between Promise CSPs. SODA 2022: 1204-1220 - [i17]Kristina Asimi, Libor Barto, Silvia Butti:
Fixed-Template Promise Model Checking Problems. CoRR abs/2205.04787 (2022) - [i16]Libor Barto, Silvia Butti:
Weisfeiler-Leman Invariant Promise Valued CSPs. CoRR abs/2205.04805 (2022) - 2021
- [j16]Libor Barto, Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal:
Algebraic Approach to Promise Constraint Satisfaction. J. ACM 68(4): 28:1-28:66 (2021) - [j15]Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker:
Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. J. Math. Log. 21(2): 2192001:1 (2021) - [c16]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 - [c15]Libor Barto, William J. DeMeo, Antoine Mottet:
Constraint Satisfaction Problems over Finite Structures. LICS 2021: 1-13 - [c14]Kristina Asimi, Libor Barto:
Finitely Tractable Promise Constraint Satisfaction Problems. MFCS 2021: 11:1-11:16 - [c13]Libor Barto, Diego Battistelli, Kevin M. Berg:
Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case. STACS 2021: 10:1-10:16 - [i15]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) - [i14]Libor Barto, Marcin Kozik:
Combinatorial Gap Theorem and Reductions between Promise CSPs. CoRR abs/2107.09423 (2021) - 2020
- [j14]Libor Barto, Michael Pinsker:
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems). SIAM J. Comput. 49(2): 365-393 (2020) - [c12]Libor Barto, Marcin Kozik, Johnson Tan, Matt Valeriote:
Sensitive Instances of the Constraint Satisfaction Problem. ICALP 2020: 110:1-110:18 - [i13]Libor Barto, Marcin Kozik, Johnson Tan, Matt Valeriote:
Sensitive instances of the Constraint Satisfaction Problem. CoRR abs/2005.00266 (2020) - [i12]Kristina Asimi, Libor Barto:
Finitely Tractable Promise Constraint Satisfaction Problems. CoRR abs/2010.04618 (2020) - [i11]Libor Barto, Diego Battistelli, Kevin M. Berg:
Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case. CoRR abs/2010.04623 (2020) - [i10]Libor Barto, William J. DeMeo, Antoine Mottet:
The Complexity of the Homomorphism Problem for Boolean structures. CoRR abs/2010.04958 (2020)
2010 – 2019
- 2019
- [j13]Libor Barto, Michael Kompatscher, Miroslav Olsák, Van Trung Pham, Michael Pinsker:
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. J. Math. Log. 19(2): 1950010:1-1950010:31 (2019) - [c11]Libor Barto:
Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps. FCT 2019: 3-17 - [c10]Libor Barto:
Promises Make Finite (Constraint Satisfaction) Problems Infinitary. LICS 2019: 1-8 - [i9]Libor Barto:
Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps. CoRR abs/1909.04871 (2019) - [i8]Libor Barto:
Promises Make Finite (Constraint Satisfaction) Problems Infinitary. CoRR abs/1909.04878 (2019) - [i7]Libor Barto, Michael Pinsker:
Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems). CoRR abs/1909.06201 (2019) - 2017
- [c9]Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker:
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. LICS 2017: 1-12 - [p2]Libor Barto, Andrei A. Krokhin, Ross Willard:
Polymorphisms, and How to Use Them. The Constraint Satisfaction Problem 2017: 1-44 - [p1]Libor Barto, Marcin Kozik:
Absorption in Universal Algebra and CSP. The Constraint Satisfaction Problem 2017: 45-77 - 2016
- [j12]Libor Barto, Alexandr Kazda:
Deciding absorption. Int. J. Algebra Comput. 26(5): 1033-1060 (2016) - [j11]Libor Barto:
The collapse of the bounded width hierarchy. J. Log. Comput. 26(3): 923-943 (2016) - [j10]Libor Barto, Marcin Kozik:
Robustly Solvable Constraint Satisfaction Problems. SIAM J. Comput. 45(4): 1646-1669 (2016) - [c8]Libor Barto:
Infinite Domain Constraint Satisfaction Problem. CSL 2016: 2:1-2:1 - [c7]Libor Barto, Michael Pinsker:
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems. LICS 2016: 615-622 - [i6]Libor Barto, Michael Pinsker:
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems. CoRR abs/1602.04353 (2016) - [i5]Libor Barto, Michael Kompatscher, Miroslav Olsák, Michael Pinsker, Van Trung Pham:
Equations in oligomorphic clones and the Constraint Satisfaction Problem for $ω$-categorical structures. CoRR abs/1612.07551 (2016) - 2015
- [j9]Libor Barto:
The Constraint Satisfaction Problem and Universal Algebra. Bull. Symb. Log. 21(3): 319-337 (2015) - [i4]Libor Barto, Jakub Oprsal, Michael Pinsker:
The wonderland of reflections. CoRR abs/1510.04521 (2015) - [i3]Libor Barto, Marcin Kozik:
Robustly Solvable Constraint Satisfaction Problems. CoRR abs/1512.01157 (2015) - [i2]Libor Barto, Alexandr Kazda:
Deciding absorption. CoRR abs/1512.07009 (2015) - 2014
- [j8]Libor Barto, Marcin Kozik:
Constraint Satisfaction Problems Solvable by Local Consistency Methods. J. ACM 61(1): 3:1-3:19 (2014) - [j7]Libor Barto:
Constraint satisfaction problem and universal algebra. ACM SIGLOG News 1(2): 14-24 (2014) - 2013
- [j6]Libor Barto, Jakub Bulin:
Csp Dichotomy for Special Polyads. Int. J. Algebra Comput. 23(5): 1151-1174 (2013) - 2012
- [j5]Libor Barto, Marcin Kozik:
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem. Log. Methods Comput. Sci. 8(1) (2012) - [c6]Libor Barto, Marcin Kozik, Ross Willard:
Near Unanimity Constraints Have Bounded Pathwidth Duality. LICS 2012: 125-134 - [c5]Libor Barto, Marcin Kozik:
Robust satisfiability of constraint satisfaction problems. STOC 2012: 931-940 - 2011
- [c4]Libor Barto:
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited. LICS 2011: 301-310 - [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
- [j4]Libor Barto:
Slices of Essentially Algebraic Categories. Appl. Categorical Struct. 17(2): 119-152 (2009) - [j3]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) - [j2]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
- [c1]Libor Barto, Marcin Kozik, Todd Niven:
Graphs, polymorphisms and the complexity of homomorphism problems. STOC 2008: 789-796 - 2005
- [j1]Libor Barto:
Weakly Terminal Objects in Quasicategories of SET Endofunctors. Appl. Categorical Struct. 13(3): 257-264 (2005)
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-10 23:42 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:
