default search action
Antoine Mottet
Person information
- affiliation: Technische Universität Hamburg, Germany
- affiliation (former): Charles University in Prague, Department of Mathematics, Czech Republic
- affiliation (former): TU Dresden, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Antoine Mottet
, Michael Pinsker
Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures. J. ACM 71(5): 36:1-36:47 (2024) - [j9]Manuel Bodirsky
Complexity Classification Transfer for CSPs via Algebraic Products. SIAM J. Comput. 53(5): 1293-1353 (2024) - [c16]Antoine Mottet
Promise and Infinite-Domain Constraint Satisfaction. CSL 2024: 41:1-41:19 - [c15]Antoine Mottet, Tomás Nagy, Michael Pinsker:
An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s. ICALP 2024: 148:1-148:18 - [c14]Zeno Bitter, Antoine Mottet:
Generalized Completion Problems with Forbidden Tournaments. MFCS 2024: 28:1-28:17 - 2023
- [c13]Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet
Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing. LICS 2023: 1-13 - [i18]Antoine Mottet, Michael Pinsker, Tomás Nagy:
An order out of nowhere: a new algorithm for infinite-domain CSPs. CoRR abs/2301.12977 (2023) - [i17]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
- [j8]Pierre Gillibert, Julius Jonusas, Michael Kompatscher
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems. SIAM J. Comput. 51(2): 175-213 (2022) - [c12]Antoine Mottet
Smooth approximations and CSPs over finitely bounded homogeneous structures. LICS 2022: 36:1-36:13 - [i16]Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová:
Complexity Classification Transfer for CSPs via Algebraic Products. CoRR abs/2211.03340 (2022) - 2021
- [j7]Antoine Mottet
Cores over Ramsey Structures. J. Symb. Log. 86(1): 352-361 (2021) - [j6]Antoine Mottet
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata. Theory Comput. Syst. 65(4): 706-735 (2021) - [j5]Manuel Bodirsky
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP. SIAM J. Comput. 50(4): 1359-1409 (2021) - [c11]Wojciech Czerwinski, Antoine Mottet
New Techniques for Universality in Unambiguous Register Automata. ICALP 2021: 129:1-129:16 - [c10]Antoine Mottet
Smooth Approximations and Relational Width Collapses. ICALP 2021: 138:1-138:20 - [c9]Libor Barto
Constraint Satisfaction Problems over Finite Structures. LICS 2021: 1-13 - [i15]Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona:
Smooth Approximations and Relational Width Collapses. CoRR abs/2102.07531 (2021) - [i14]Wojciech Czerwinski, Antoine Mottet, Karin Quaas:
New Techniques for Universality in Unambiguous Register Automata. CoRR abs/2102.08331 (2021) - 2020
- [j4]Franz Baader
Extensions of unification modulo ACUI. Math. Struct. Comput. Sci. 30(6): 597-626 (2020) - [c8]Pierre Gillibert
Hrushovski's Encoding and ω-Categorical CSP Monsters. ICALP 2020: 131:1-131:17 - [i13]Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker:
When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems. CoRR abs/2002.07054 (2020) - [i12]Antoine Mottet, Michael Pinsker:
Cores over Ramsey structures. CoRR abs/2004.05936 (2020) - [i11]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
ω-categorical structures avoiding height 1 identities. CoRR abs/2006.12254 (2020) - [i10]Libor Barto, William J. DeMeo, Antoine Mottet:
The Complexity of the Homomorphism Problem for Boolean structures. CoRR abs/2010.04958 (2020) - [i9]Antoine Mottet, Michael Pinsker:
Smooth approximations and CSPs over finitely bounded homogeneous structures. CoRR abs/2011.03978 (2020)
2010 – 2019
- 2019
- [c7]Manuel Bodirsky
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS 2019: 1-12 - [c6]Antoine Mottet
The Containment Problem for Unambiguous Register Automata. STACS 2019: 53:1-53:15 - [i8]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). CoRR abs/1901.04237 (2019) - [i7]Antoine Mottet, Karin Quaas:
On the Containment Problem for Unambiguous Single-Register Automata with Guessing. CoRR abs/1905.12445 (2019) - 2018
- [j3]Manuel Bodirsky
Discrete Temporal Constraint Satisfaction Problems. J. ACM 65(2): 9:1-9:41 (2018) - [j2]Manuel Bodirsky
A Dichotomy for First-Order Reducts of Unary Structures. Log. Methods Comput. Sci. 14(2) (2018) - [c5]Manuel Bodirsky
Classification Transfer for Qualitative Reasoning Problems. IJCAI 2018: 1256-1262 - [c4]Manuel Bodirsky
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. LICS 2018: 105-114 - [c3]Manuel Bodirsky
The Complexity of Disjunctive Linear Diophantine Constraints. MFCS 2018: 33:1-33:16 - [i6]Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet:
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. CoRR abs/1802.03255 (2018) - [i5]Barnaby Martin, Peter Jonsson, Manuel Bodirsky, Antoine Mottet:
Classification transfer for qualitative reasoning problems. CoRR abs/1805.02038 (2018) - [i4]Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet:
The complexity of disjunctive linear Diophantine constraints. CoRR abs/1807.00985 (2018) - [i3]Antoine Mottet, Karin Quaas:
The Containment Problem for Unambiguous Register Automata. CoRR abs/1809.08985 (2018) - 2016
- [j1]Manuel Bodirsky
Distance constraint satisfaction problems. Inf. Comput. 247: 87-105 (2016) - [c2]Manuel Bodirsky
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. LICS 2016: 623-632 - [i2]Manuel Bodirsky, Antoine Mottet:
A Dichotomy for First-Order Reducts of Unary Structures. CoRR abs/1601.04520 (2016) - 2015
- [c1]Manuel Bodirsky
Constraint Satisfaction Problems over the Integers with Successor. ICALP (1) 2015: 256-267 - [i1]Manuel Bodirsky, Barnaby Martin, Antoine Mottet:
Discrete Temporal Constraint Satisfaction Problems. CoRR abs/1503.08572 (2015)
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-12-02 21:28 CET 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: