Libor Barto

According to our database1, Libor Barto authored at least 31 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems).
SIAM J. Comput., 2020

The Complexity of the Homomorphism Problem for Boolean structures.
CoRR, 2020

Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case.
CoRR, 2020

Finitely Tractable Promise Constraint Satisfaction Problems.
CoRR, 2020

Sensitive Instances of the Constraint Satisfaction Problem.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures.
J. Math. Log., 2019

Promises Make Finite (Constraint Satisfaction) Problems Infinitary.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2017
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Polymorphisms, and How to Use Them.
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

Absorption in Universal Algebra and CSP.
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

2016
Robustly Solvable Constraint Satisfaction Problems.
SIAM J. Comput., 2016

The collapse of the bounded width hierarchy.
J. Log. Comput., 2016

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

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Infinite Domain Constraint Satisfaction Problem.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015
The wonderland of reflections.
CoRR, 2015

2014
Constraint satisfaction problem and universal algebra.
ACM SIGLOG News, 2014

Constraint Satisfaction Problems Solvable by Local Consistency Methods.
J. ACM, 2014

2013
Csp Dichotomy for Special Polyads.
Int. J. Algebra Comput., 2013

2012
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
Log. Methods Comput. Sci., 2012

Near Unanimity Constraints Have Bounded Pathwidth Duality.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011
Robust Satisfiability of Constraint Satisfaction Problems.
Electron. Colloquium Comput. Complex., 2011

The Dichotomy for Conservative Constraint Satisfaction Problems Revisited.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
New Conditions for Taylor Varieties and CSP.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009
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., 2009

Congruence Distributivity Implies Bounded Width.
SIAM J. Comput., 2009

Slices of Essentially Algebraic Categories.
Appl. Categorical Struct., 2009

Constraint Satisfaction Problems of Bounded Width.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
Graphs, polymorphisms and the complexity of homomorphism problems.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

2005
Weakly Terminal Objects in Quasicategories of SET Endofunctors.
Appl. Categorical Struct., 2005


  Loading...