Michael Pinsker

894 total citations
46 papers, 361 citations indexed

About

Michael Pinsker is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Computer Networks and Communications. According to data from OpenAlex, Michael Pinsker has authored 46 papers receiving a total of 361 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 30 papers in Geometry and Topology and 14 papers in Computer Networks and Communications. Recurrent topics in Michael Pinsker's work include Advanced Topology and Set Theory (29 papers), Advanced Algebra and Logic (17 papers) and semigroups and automata theory (14 papers). Michael Pinsker is often cited by papers focused on Advanced Topology and Set Theory (29 papers), Advanced Algebra and Logic (17 papers) and semigroups and automata theory (14 papers). Michael Pinsker collaborates with scholars based in Austria, France and Czechia. Michael Pinsker's co-authors include Manuel Bodirsky, Libor Barto, Todor Tsankov, Martin Goldstern, Hubie Chen, Mai Gehrke, Saharon Shelah, Csaba Szabó, David M. Evans and Marcin Kozik and has published in prestigious journals such as Journal of the ACM, Transactions of the American Mathematical Society and SIAM Journal on Computing.

In The Last Decade

Michael Pinsker

43 papers receiving 324 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Michael Pinsker Austria 11 303 181 161 71 61 46 361
Benoît Larose Canada 12 335 1.1× 92 0.5× 145 0.9× 59 0.8× 136 2.2× 43 422
Libor Barto Czechia 14 554 1.8× 68 0.4× 361 2.2× 85 1.2× 53 0.9× 36 604
Marcin Kozik Poland 10 376 1.2× 42 0.2× 233 1.4× 55 0.8× 39 0.6× 26 414
Matthew Valeriote Canada 11 523 1.7× 100 0.6× 137 0.9× 117 1.6× 35 0.6× 42 590
Phyllis Zweig Chinn United States 4 227 0.7× 58 0.3× 91 0.6× 24 0.3× 35 0.6× 11 286
Omid Amini France 9 142 0.5× 75 0.4× 39 0.2× 14 0.2× 35 0.6× 28 207
Ross Willard Canada 13 427 1.4× 39 0.2× 106 0.7× 128 1.8× 20 0.3× 44 456
Petar Marković Serbia 9 210 0.7× 25 0.1× 89 0.6× 45 0.6× 30 0.5× 24 241
Zevi Miller United States 9 184 0.6× 89 0.5× 63 0.4× 32 0.5× 71 1.2× 29 261
Charles Vanden Eynden United States 11 137 0.5× 52 0.3× 28 0.2× 113 1.6× 98 1.6× 55 305

Countries citing papers authored by Michael Pinsker

Since Specialization
Citations

This map shows the geographic impact of Michael Pinsker's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Pinsker with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Pinsker more than expected).

Fields of papers citing papers by Michael Pinsker

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Pinsker. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Pinsker. The network helps show where Michael Pinsker may publish in the future.

Co-authorship network of co-authors of Michael Pinsker

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Pinsker. A scholar is included among the top collaborators of Michael Pinsker based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Pinsker. Michael Pinsker is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Pinsker, Michael, et al.. (2024). Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough. SIAM Journal on Computing. 53(6). 1709–1745.
2.
Pinsker, Michael, et al.. (2024). Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures. Journal of the ACM. 71(5). 1–47.
3.
Pinsker, Michael, et al.. (2022). When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems. SIAM Journal on Computing. 51(2). 175–213. 5 indexed citations
4.
5.
Pinsker, Michael & Manuel Bodirsky. (2021). Canonical functions: a proof via topological dynamics. Contributions to Discrete Mathematics. 16(2). 36–45. 8 indexed citations
6.
Pinsker, Michael, et al.. (2021). Collapsing the bounded width hierarchy for infinite-domain CSPs: when\n symmetries are enough. arXiv (Cornell University). 1 indexed citations
7.
Barto, Libor & Michael Pinsker. (2020). Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems). SIAM Journal on Computing. 49(2). 365–393. 9 indexed citations
8.
Pinsker, Michael, et al.. (2020). Hrushovski’s Encoding and ω-Categorical CSP Monsters. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
9.
Bodirsky, Manuel, et al.. (2019). Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems).. arXiv (Cornell University). 1 indexed citations
10.
Bodirsky, Manuel, et al.. (2018). The Universal Homogenous Binary Tree. CLOK (University of Central Lancashire). 6 indexed citations
11.
12.
Bodirsky, Manuel, et al.. (2015). Distance constraint satisfaction problems. Information and Computation. 247. 87–105. 2 indexed citations
13.
Bodirsky, Manuel & Michael Pinsker. (2014). Topological Birkhoff. Transactions of the American Mathematical Society. 367(4). 2527–2549. 23 indexed citations
14.
Pinsker, Michael, et al.. (2013). A new operation on partially ordered sets. Journal of Combinatorial Theory Series A. 120(7). 1450–1462. 3 indexed citations
15.
Pinsker, Michael & Saharon Shelah. (2013). Universality of the lattice of transformation monoids. Proceedings of the American Mathematical Society. 141(9). 3005–3011. 3 indexed citations
16.
Bodirsky, Manuel, Michael Pinsker, & Todor Tsankov. (2011). Decidability of Definability. 321–328. 9 indexed citations
17.
Bodirsky, Manuel & Michael Pinsker. (2010). Minimal functions on the random graph and the product ramsey theorem. arXiv (Cornell University). 1 indexed citations
18.
Pinsker, Michael. (2007). Monoidal intervals of clones on infinite sets. Discrete Mathematics. 308(1). 59–70. 2 indexed citations
19.
Pinsker, Michael, et al.. (2006). Some Observations on Minimal Clones. 2919. 24–24. 2 indexed citations
20.
Pinsker, Michael. (2002). Rosenberg's characterization of maximal clones. reposiTUm (TU Wien). 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Benoît Larose Breakdown of academic impact, for papers by Libor Barto Breakdown of academic impact, for papers by Marcin Kozik Breakdown of academic impact, for papers by Matthew Valeriote Breakdown of academic impact, for papers by Phyllis Zweig Chinn Breakdown of academic impact, for papers by Omid Amini Breakdown of academic impact, for papers by Ross Willard Breakdown of academic impact, for papers by Petar Marković Breakdown of academic impact, for papers by Zevi Miller Breakdown of academic impact, for papers by Charles Vanden Eynden
Rankless by CCL
2026