Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Pinsker
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i25]Antoine Mottet, Michael Pinsker, Tomás Nagy:
An order out of nowhere: a new algorithm for infinite-domain CSPs. CoRR abs/2301.12977 (2023)- [i24]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
- [j20]Pierre Gillibert, Julius Jonusas, Michael Kompatscher
, Antoine Mottet, Michael Pinsker:
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems. SIAM J. Comput. 51(2): 175-213 (2022) - [c14]Michael Pinsker:
Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep. ISMVL 2022: 80-87 - [c13]Antoine Mottet, Michael Pinsker:
Smooth approximations and CSPs over finitely bounded homogeneous structures. LICS 2022: 36:1-36:13 - [i23]Michael Pinsker:
Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep. CoRR abs/2203.17182 (2022) - 2021
- [j19]Michael Pinsker, Manuel Bodirsky:
Canonical functions: a proof via topological dynamics. Contributions Discret. Math. 16(2): 36-45 (2021) - [j18]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) - [j17]Manuel Bodirsky, Michael Pinsker, András Pongrácz:
Projective clone Homomorphisms. J. Symb. Log. 86(1): 148-161 (2021) - [j16]Antoine Mottet, Michael Pinsker:
Cores over Ramsey Structures. J. Symb. Log. 86(1): 352-361 (2021) - [c12]Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona:
Smooth Approximations and Relational Width Collapses. ICALP 2021: 138:1-138:20 - [i22]Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona:
Smooth Approximations and Relational Width Collapses. CoRR abs/2102.07531 (2021) - 2020
- [j15]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) - [c11]Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker:
Hrushovski's Encoding and ω-Categorical CSP Monsters. ICALP 2020: 131:1-131:17 - [i21]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) - [i20]Antoine Mottet, Michael Pinsker:
Cores over Ramsey structures. CoRR abs/2004.05936 (2020) - [i19]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
ω-categorical structures avoiding height 1 identities. CoRR abs/2006.12254 (2020) - [i18]Antoine Mottet, Michael Pinsker:
Smooth approximations and CSPs over finitely bounded homogeneous structures. CoRR abs/2011.03978 (2020)
2010 – 2019
- 2019
- [j14]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) - [j13]Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz:
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. SIAM J. Comput. 48(4): 1224-1264 (2019) - [c10]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS 2019: 1-12 - [i17]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) - [i16]Libor Barto, Michael Pinsker:
Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems). CoRR abs/1909.06201 (2019) - 2018
- [j12]Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz:
The universal homogeneous binary tree. J. Log. Comput. 28(1): 133-163 (2018) - [i15]Pierre Gillibert, Julius Jonusas, Michael Pinsker:
Pseudo-loop conditions. CoRR abs/1812.00396 (2018) - 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 - 2016
- [j11]Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker:
Distance constraint satisfaction problems. Inf. Comput. 247: 87-105 (2016) - [c8]Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz:
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. ICALP 2016: 119:1-119:14 - [c7]Libor Barto, Michael Pinsker:
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems. LICS 2016: 615-622 - [i14]Libor Barto, Michael Pinsker:
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems. CoRR abs/1602.04353 (2016) - [i13]Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz:
Constraint satisfaction problems for reducts of homogeneous graphs. CoRR abs/1602.05819 (2016) - [i12]Manuel Bodirsky, Michael Pinsker:
Canonical Functions: a proof via topological dynamics. CoRR abs/1610.09660 (2016) - [i11]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
- [j10]Julie Linman, Michael Pinsker:
Permutations on the Random Permutation. Electron. J. Comb. 22(2): 2 (2015) - [j9]Manuel Bodirsky, Michael Pinsker:
Schaefer's Theorem for Graphs. J. ACM 62(3): 19:1-19:52 (2015) - [i10]Michael Pinsker:
Algebraic and model theoretic methods in constraint satisfaction. CoRR abs/1507.00931 (2015) - [i9]Libor Barto, Jakub Oprsal, Michael Pinsker:
The wonderland of reflections. CoRR abs/1510.04521 (2015) - 2014
- [i8]Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz:
The universal homogeneous binary tree. CoRR abs/1409.2170 (2014) - [i7]Manuel Bodirsky, Michael Pinsker, András Pongrácz:
Projective clone homomorphisms. CoRR abs/1409.4601 (2014) - 2013
- [j8]Martin Goldstern, Michael Pinsker, Saharon Shelah:
A Closed Algebra with a Non-Borel Clone and an Ideal with a Borel Clone. Int. J. Algebra Comput. 23(5): 1115-1126 (2013) - [j7]Péter Pál Pach, Michael Pinsker, András Pongrácz, Csaba A. Szabó:
A new operation on partially ordered sets. J. Comb. Theory, Ser. A 120(7): 1450-1462 (2013) - [j6]Manuel Bodirsky, Michael Pinsker, Todor Tsankov:
Decidability of definability. J. Symb. Log. 78(4): 1036-1054 (2013) - [i6]Manuel Bodirsky, Michael Pinsker, András Pongrácz:
Reconstructing the topology of clones. CoRR abs/1312.7699 (2013) - 2012
- [i5]Manuel Bodirsky, Michael Pinsker:
Topological Birkhoff. CoRR abs/1203.1876 (2012) - 2011
- [c6]Manuel Bodirsky, Michael Pinsker, Todor Tsankov:
Decidability of Definability. LICS 2011: 321-328 - [c5]Manuel Bodirsky, Michael Pinsker:
Schaefer's theorem for graphs. STOC 2011: 655-664 - [i4]Manuel Bodirsky, Michael Pinsker:
Reducts of Ramsey structures. CoRR abs/1105.6073 (2011) - 2010
- [j5]Manuel Bodirsky, Hubie Chen, Michael Pinsker:
The reducts of equality up to primitive positive interdefinability. J. Symb. Log. 75(4): 1249-1292 (2010) - [j4]Michael Pinsker:
More Sublattices of the Lattice of Local Clones. Order 27(3): 353-364 (2010) - [c4]Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker:
Distance Constraint Satisfaction Problems. MFCS 2010: 162-173 - [i3]Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker:
Distance Constraint Satisfaction Problems. CoRR abs/1004.3842 (2010) - [i2]Manuel Bodirsky, Michael Pinsker:
Schaefer's theorem for graphs. CoRR abs/1011.2894 (2010) - [i1]Manuel Bodirsky, Michael Pinsker, Todor Tsankov:
Decidability of definability. CoRR abs/1012.2381 (2010)
2000 – 2009
- 2009
- [j3]Mathias Beiglböck, Martin Goldstern, Lutz Heindorf, Michael Pinsker:
Clones from Ideals. Int. J. Algebra Comput. 19(3): 397-421 (2009) - [c3]Manuel Bodirsky, Michael Pinsker:
Reducts of Ramsey Structures. AMS-ASL Joint Special Session 2009: 489- - 2008
- [j2]Michael Pinsker:
Monoidal intervals of clones on infinite sets. Discret. Math. 308(1): 59-70 (2008) - 2007
- [j1]Hajime Machida, Michael Pinsker:
Some Polynomials Generating Minimal Clones. J. Multiple Valued Log. Soft Comput. 13(4-6): 353-366 (2007) - [c2]Hajime Machida, Michael Pinsker:
Polynomials as Generators of Minimal Clones. ISMVL 2007: 7 - 2006
- [c1]Hajime Machida, Michael Pinsker:
Some Observations on Minimal Clones. ISMVL 2006: 24
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-03-26 01:50 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:
