Antoine Mottet

Affiliations:
  • Technische Universität Hamburg, Germany
  • Charles University in Prague, Department of Mathematics, Czech Republic (former)
  • TU Dresden, Germany (former)


According to our database1, Antoine Mottet authored at least 29 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Promise and Infinite-Domain Constraint Satisfaction.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Symmetries of structures that fail to interpret something finite.
CoRR, 2023

An order out of nowhere: a new algorithm for infinite-domain CSPs.
CoRR, 2023

Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing.
LICS, 2023

2022
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems.
SIAM J. Comput., 2022

Complexity Classification Transfer for CSPs via Algebraic Products.
CoRR, 2022

Smooth approximations and CSPs over finitely bounded homogeneous structures.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP.
SIAM J. Comput., 2021

The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata.
Theory Comput. Syst., 2021

Cores over Ramsey Structures.
J. Symb. Log., 2021

Constraint Satisfaction Problems over Finite Structures.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Smooth Approximations and Relational Width Collapses.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

New Techniques for Universality in Unambiguous Register Automata.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Extensions of unification modulo ACUI.
Math. Struct. Comput. Sci., 2020

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

ω-categorical structures avoiding height 1 identities.
CoRR, 2020

Hrushovski's Encoding and ω-Categorical CSP Monsters.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
On the Containment Problem for Unambiguous Single-Register Automata with Guessing.
CoRR, 2019

Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems).
CoRR, 2019

The Containment Problem for Unambiguous Register Automata.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems).
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
A Dichotomy for First-Order Reducts of Unary Structures.
Log. Methods Comput. Sci., 2018

Discrete Temporal Constraint Satisfaction Problems.
J. ACM, 2018

The Complexity of Disjunctive Linear Diophantine Constraints.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Classification Transfer for Qualitative Reasoning Problems.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2016
Distance constraint satisfaction problems.
Inf. Comput., 2016

Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
Constraint Satisfaction Problems over the Integers with Successor.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015


  Loading...