Mottet, A., & Pinsker, M. (2024). Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures. Journal of the ACM, 71(5), Article 36. https://doi.org/10.1145/3689207 ( reposiTUm)

Mottet, A., Nagy, T., Pinsker, M., & Wrona, M. (2024). Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough. SIAM Journal on Computing, 53(6), 1709–1745. https://doi.org/10.1137/22M1538934 ( reposiTUm)

Elliott, L., Jonušas, J., Mitchell, J. D., Péresse, Y., & Pinsker, M. (2023). Polish topologies on endomorphism monoids of relational structures. Advances in Mathematics, 431, Article 109214. https://doi.org/10.1016/j.aim.2023.109214 ( reposiTUm)

Pinsker, M., & Schindler, C. (2023). ON THE ZARISKI TOPOLOGY ON ENDOMORPHISM MONOIDS OF OMEGA-CATEGORICAL STRUCTURES. Journal of Symbolic Logic. https://doi.org/10.1017/jsl.2023.81 ( reposiTUm)

Gillibert, P., Jonusas, J., Kompatscher, M., Mottet, A., & Pinsker, M. (2022). When symmetries are not enough: a hierarchy of hard constraint satisfaction problems. SIAM Journal on Computing, 51(2), 175–213. https://doi.org/10.1137/20M1383471 ( reposiTUm)

Bodirsky, M., Mottet, A., Olšák, M., Opršal, J., Pinsker, M., & Willard, R. (2021). Omega-categorical structures avoiding height 1 identities. Transactions of the American Mathematical Society, 374(1), 327–350. https://doi.org/10.1090/tran/8179 ( reposiTUm)

Pinsker, M., & Mottet, A. (2021). Cores over Ramsey Structures. Journal of Symbolic Logic, 86(1), 352–361. https://doi.org/10.1017/jsl.2021.6 ( reposiTUm)

Pinsker, M., Bodirsky, M., & Pongrácz, A. (2021). Projective Clone Homomorphisms. Journal of Symbolic Logic, 86(1), 148–161. https://doi.org/10.1017/jsl.2019.23 ( reposiTUm)

Pinsker, M., & Bodirsky, M. (2021). Canonical Functions: a proof via topological dynamics. CONTRIBUTIONS TO DISCRETE MATHEMATICS, 16(2), 36–45. https://doi.org/10.11575/cdm.v16i2.71724 ( reposiTUm)

Barto, L., & Pinsker, M. (2020). Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems). SIAM Journal on Computing, 49(2), 365–393. https://doi.org/10.1137/18m1216213 ( reposiTUm)

Gillibert, P., Jonusas, J., & Pinsker, M. (2019). Pseudo-loop conditions. Bulletin of the London Mathematical Society, 51(5), 917–936. https://doi.org/10.1112/blms.12286 ( reposiTUm)

Gehrke, M., & Pinsker, M. (2018). Uniform Birkhoff. Journal of Pure and Applied Algebra, 222(5), 1242–1250. https://doi.org/10.1016/j.jpaa.2017.06.016 ( reposiTUm)

Barto, L., Opršal, J., & Pinsker, M. (2018). The wonderland of reflections. Israel Journal of Mathematics, 223(1), 363–398. https://doi.org/10.1007/s11856-017-1621-9 ( reposiTUm)

Bodirsky, M., Evans, D., Kopatscher, M., & Pinsker, M. (2018). A counterexample to the reconstruction of ω-categorical structures from their endomorphism monoids. Israel Journal of Mathematics, 224(1), 57–82. https://doi.org/10.1007/s11856-018-1645-9 ( reposiTUm)

Bodirsky, M., Bradley-Williams, D., Pinsker, M., & Pongrácz, A. (2017). The Universal Homogeneous Binary Tree. Journal of Logic and Computation, 28(1), 133–163. https://doi.org/10.1093/logcom/exx043 ( reposiTUm)

Bodirsky, M., Pinsker, M., & Pongrácz, A. (2017). Reconstructing the topology of clones. Transactions of the American Mathematical Society, 369(5), 3707–3740. https://doi.org/10.1090/tran/6937 ( reposiTUm)

Bodirsky, M., Dalmau, V., Barnaby, M., Mottet, A., & Pinsker, M. (2016). Distance constraint satisfaction problems. Information and Computation, 247, 87–105. https://doi.org/10.1016/j.ic.2015.11.010 ( reposiTUm)

Linman, J., & Pinsker, M. (2015). Permutations on the Random Permutation. Electronic Journal of Combinatorics, 22(2). https://doi.org/10.37236/4910 ( reposiTUm)

Pinsker, M. (2015). The 42 reducts of the random ordered graph. LMS Journal of Computation and Mathematics, 111(3), 591–632. http://hdl.handle.net/20.500.12708/151434 ( reposiTUm)

Pinsker, M. (2015). Topological Birkhoff. Transactions of the American Mathematical Society, 367, 2527–2549. http://hdl.handle.net/20.500.12708/151435 ( reposiTUm)

Bodirsky, M., & Pinsker, M. (2015). Schaefer’s Theorem for Graphs. Journal of the ACM, 62(3), 1–52. https://doi.org/10.1145/2764899 ( reposiTUm)

Pach, P. P., Pinsker, M., Pluhár, G., Pongrácz, A., & Szabó, C. (2014). Reducts of the random partial order. Advances in Mathematics, 267, 94–120. https://doi.org/10.1016/j.aim.2014.08.008 ( reposiTUm)

Goldstern, M., Pinsker, M., & Shelah, S. (2013). A Closed Algebra with a Non-Borel Clone and an Ideal with a Borel Clone. International Journal of Algebra and Computation, 23(05), 1115–1125. https://doi.org/10.1142/s0218196713500197 ( reposiTUm)

Pach, P. P., Pinsker, M., Pongrácz, A., & Szabó, C. (2013). A new operation on partially ordered sets. Journal of Combinatorial Theory, Series A, 120(7), 1450–1462. https://doi.org/10.1016/j.jcta.2013.04.003 ( reposiTUm)

Pinsker, M., & Shelah, S. (2013). Universality of the lattice of transformation monoids. Proceedings of the American Mathematical Society, 141(9), 3005–3011. https://doi.org/10.1090/s0002-9939-2013-11566-2 ( reposiTUm)

Goldstern, M., & Pinsker, M. (2009). Ideal clones: solution to a problem of Czédil and Heindorf. Studia Scientiarum Mathematicarum Hungarica, 47(4), 419–429. https://doi.org/10.1556/sscmath.2009.1138 ( reposiTUm)

Beiglböck, M., Goldstern, M., Heindorf, L., & Pinsker, M. (2009). Clones from ideals. International Journal of Algebra and Computation, 19(3), 397–421. http://hdl.handle.net/20.500.12708/165833 ( reposiTUm)

Pinsker, M. (2008). Monoidal intervals of clones on infinite sets. Discrete Mathematics, 308(1), 59–70. https://doi.org/10.1016/j.disc.2007.03.039 ( reposiTUm)

Goldstern, M., & Pinsker, M. (2008). A survey of clones on infinite sets. Algebra Universalis, 59(3–4), 365–403. https://doi.org/10.1007/s00012-008-2100-2 ( reposiTUm)

Machida, H., & Pinsker, M. (2007). The minimal clones above the permutations. Semigroup Forum, 75(1), 181–211. https://doi.org/10.1007/s00233-007-0720-z ( reposiTUm)

Pinsker, M. (2007). Algebraic lattices are complete sublattices of the clone lattice over an infinite set. Fundamenta Mathematicae, 195, 1–10. http://hdl.handle.net/20.500.12708/168720 ( reposiTUm)

Machida, H., & Pinsker, M. (2007). Some polynomials generating minimal clones. Journal of Multiple-Valued Logic and Soft Computing, 13, 353–365. http://hdl.handle.net/20.500.12708/168744 ( reposiTUm)

Pinsker, M. (2006). Precomplete clones on infinite sets which are closed under conjugation. Monatshefte Für Mathematik, 148, 139–152. http://hdl.handle.net/20.500.12708/172017 ( reposiTUm)

Pinsker, M. (2005). The number of unary clones containing the permutations on an infinite set. Acta Sci.Math. (Szeged), 71, 461–467. http://hdl.handle.net/20.500.12708/172016 ( reposiTUm)

Pinsker, M. (2005). Maximal clones on uncountable sets that include all permutations. Algebra Universalis, 54, 129–148. http://hdl.handle.net/20.500.12708/172055 ( reposiTUm)

Pinsker, M. (2004). Clones containing all almost unary function. Algebra Universalis, 51, 235–255. http://hdl.handle.net/20.500.12708/174576 ( reposiTUm)

Mottet, A., Nagy, T., & Pinsker, M. (2024). An Order out of Nowhere: A New Algorithm for Infinite-Domain CSPs. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Tallinn, Estonia. https://doi.org/10.4230/LIPIcs.ICALP.2024.148 ( reposiTUm)

Pinsker, M. (2023). Topologies on endomorphism monoids of generic structures. In Programme and Abstracts Conference on Generic Structures 2023 (pp. 6–6). ( reposiTUm)

Pinsker, M. (2023). Constraint Satisfaction Problems: algebraic and model-theoretic challenges to distinguish the easy from the hard. In Book of Abstracts for the Workshop Combinatorial Problems in Model Theory and Computer Science (pp. 6–7). ( reposiTUm)

Barto, L., Bodor, B., Kozik, M., Mottet, A., & Pinsker, M. (2023). Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing. In 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Boston, MA, United States of America (the). IEEE. https://doi.org/10.1109/LICS56636.2023.10175732 ( reposiTUm)

Pinsker, M. (2022). Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep. In 2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL) (pp. 80–87). IEEE. https://doi.org/10.1109/ISMVL52857.2022.00019 ( reposiTUm)

Mottet, A., & Pinsker, M. (2022). Smooth approximations and CSPs over finitely bounded homogeneous structures. In C. Baier (Ed.), Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). https://doi.org/10.1145/3531130.3533353 ( reposiTUm)

Mottet, A., Nagy, T., Pinsker, M., & Wrona, M. (2021). Smooth approximations and relational width collapses. In N. Bansal, E. Merelli, & J. Worrell (Eds.), Proceedings of the 48th International Colloquium on Automata, Languages and Programming (pp. 1–20). Proceedings of the 48th International Colloquium on Automata, Languages and Programming. http://hdl.handle.net/20.500.12708/41793 ( reposiTUm)

Pinsker, M., Gillibert, P., Jonusas, J., Kompatscher, M., & Mottet, A. (2020). Hrushovski’s encoding and omega-categorical CSP monsters, pandemiebedingt on-line. In Proceedings of the 47th International Colloquium on Automata, Languages and Programming (pp. 1–17). https://doi.org/10.4230/LIPIcs.ICALP.2020.131 ( reposiTUm)

Kompatscher, M., & Pinsker, M. (2017). The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press. https://doi.org/10.1109/lics.2017.8005128 ( reposiTUm)

Bodirsky, M., Barnaby, M., Pinsker, M., & Pongrácz, A. (2016). Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. In I. Chatzigiannakis, M. Mitzenmacher, Y. Rabani, & D. Sangiorgi (Eds.), Proceedings of 43rd International Colloquium on Automata, Languages, and Programming, ICALP (pp. 119:1-119:14). Springer. https://doi.org/10.4230/LIPIcs.ICALP.2016.119 ( reposiTUm)

Pinsker, M. (2016). The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. ACM Press. https://doi.org/10.1145/2933575.2934544 ( reposiTUm)

Machida, H., & Pinsker, M. (2007). Polynomials as Generators of Minimal Clones. In 37th International Symposium on Multiple-Valued Logic (ISMVL’07). IEEE Computer Society. https://doi.org/10.1109/ismvl.2007.41 ( reposiTUm)

Machida, H., & Pinsker, M. (2006). Some observations on minimal clones. In Proc. 36th International Symposium on Multiple-Valued Logic. IEEE Computer Society. http://hdl.handle.net/20.500.12708/40632 ( reposiTUm)

Pinsker, M. (2025, March 14). Sudokus und die Millenium-Probleme [Presentation]. International Day of Mathematics, Wien, Austria. ( reposiTUm)

Pinsker, M. (2025, May 23). Binary symmetries of tractable non-rigid structures [Conference Presentation]. The Constraint Satisfaction Problem: Complexity and Approximability, Dagstuhl, Germany. http://hdl.handle.net/20.500.12708/221323 ( reposiTUm)

Pinsker, M. (2024, July 29). Topologies on endomorphism monoids of generic structures [Conference Presentation]. Midsummer Combinatorial Workshop XXIX, Prag, Czechia. http://hdl.handle.net/20.500.12708/210828 ( reposiTUm)

Pinsker, M. (2024, June 25). The power of polymorphisms: the triangle of universal algebra, model theory, and theoretical computer science [Conference Presentation]. Topology, Algebra, and Categories in Logic - Summer School - 2024, Spain. http://hdl.handle.net/20.500.12708/210795 ( reposiTUm)

Pinsker, M. (2024, March 5). Constraint Satisfaction Problems: distinguishing the easy from the hard [Conference Presentation]. Algebra Colloquium 2024, Czechia. http://hdl.handle.net/20.500.12708/210791 ( reposiTUm)

Pinsker, M. (2024, April 11). Warum fallen Sudokus selbst Computern schwer? [Presentation]. TUforMath 2024, Wien, Austria. http://hdl.handle.net/20.500.12708/210793 ( reposiTUm)

Pinsker, M. (2023, June 9). The semigroup of increasing functions on the rationals and its unique Polish topology [Conference Presentation]. 103rd WORKSHOP ON GENERAL ALGEBRA 2023, Tartu, Estonia. ( reposiTUm)

Pinsker, M. (2023, July). Loop Conditions [Keynote Presentation]. Algebra Week 2023, Siena, Italy. ( reposiTUm)

Pinsker, M. (2022, May 17). Surprises in infinite-domain Constraint Satisfaction, or: an order out of nothing [Presentation]. The Constraint Satisfaction Problem: Complexity and Approximability 2023, Dagstuhl, Germany. ( reposiTUm)

Pinsker, M. (2019). Topology on clones: relevant or irrelevant? 57th Summer School on General Algebra and Ordered Sets, Karolinka, Czechia. http://hdl.handle.net/20.500.12708/122877 ( reposiTUm)

Pinsker, M. (2018). Loop conditions. The Constraint Satisfaction Problem: Complexity and Approximability, Schloss Dagstuhl, Germany. http://hdl.handle.net/20.500.12708/122682 ( reposiTUm)

Pinsker, M. (2018). Equations in algebras induced by beautiful first-order structures. Prague Gathering of Logicians-Beauty of Logic, Prag, Czechia. http://hdl.handle.net/20.500.12708/122594 ( reposiTUm)

Pinsker, M. (2018). Canonical Functions and the Ramsey Property, revisited. AMS-ASL, Special Session on Set Theory, Logic and Ramsey Theory, San Diego, United States of America (the). http://hdl.handle.net/20.500.12708/122679 ( reposiTUm)

Pinsker, M. (2018). Reconstructing structures from their clones. Set Theory, Model Theory and Applications, Ben-Gurion, Israel. http://hdl.handle.net/20.500.12708/122683 ( reposiTUm)

Pinsker, M. (2018). Canonical Functions and the Ramsey Property, revisited. Workshop on Unifying Themes in Ramsey Theory, BANFF International Research Station, Alberta, Canada. http://hdl.handle.net/20.500.12708/122681 ( reposiTUm)

Pinsker, M. (2017). Equations in algebras from omega-categorical structures. Seminar an der TU Wien, Wien, 06/2017, Austria. http://hdl.handle.net/20.500.12708/86659 ( reposiTUm)

Pinsker, M. (2017). The two dichotomy conjectures for in nite domain CSPs are equivalent. 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, Reykjavik, Iceland. http://hdl.handle.net/20.500.12708/86657 ( reposiTUm)

Pinsker, M. (2017). Double-shrinking pseudo-Siggers. LIAFA, Paris, France. http://hdl.handle.net/20.500.12708/86658 ( reposiTUm)

Pinsker, M., Kompatscher, M., Barto, L., Olsak, M., & Van Pham, T. (2017). The two Dichotomy Conjectures for Infinite Domain CSPs are Equivalent. 32nd ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland. http://hdl.handle.net/20.500.12708/122119 ( reposiTUm)

Kompatscher, M., & Pinsker, M. (2017). Oligomorphic clones. Tianfu Universal Algebra workshop, South West University of Finance and Economics, Chengdu, China. http://hdl.handle.net/20.500.12708/86593 ( reposiTUm)

Pinsker, M. (2017). Equations in oligomorphic algebras. AAA 93, Bern, Switzerland. http://hdl.handle.net/20.500.12708/86604 ( reposiTUm)

Pinsker, M. (2015). Uniform Birkhoff. Workshop Duality in Computer Science, Dagstuhl, Germany. http://hdl.handle.net/20.500.12708/86186 ( reposiTUm)

Pinsker, M. (2015). Uniform Birkhoff. Technische Universität Dresden, Dresden, Germany. http://hdl.handle.net/20.500.12708/86187 ( reposiTUm)

Pinsker, M. (2015). Topological clones. EPSRC Durham Symposium Permutation Groups and Transformation Semigroups, Durham, United Kingdom of Great Britain and Northern Ireland (the). http://hdl.handle.net/20.500.12708/86138 ( reposiTUm)

Pinsker, M. (2015). Topological clones. Topology, Algebra, and Categories in Logic 2015 (TACL 2015), Ischia, Italy. http://hdl.handle.net/20.500.12708/86139 ( reposiTUm)

Pinsker, M. (2015). Conjectures for clones over finitely bounded homogenous structures. Workshop on Homogeneous Structures, Banff International Research Station, Banff, Canada. http://hdl.handle.net/20.500.12708/86102 ( reposiTUm)

Pinsker, M. (2014). The topology of algebras, or: Polish clones. Arbeitstagung Allgemeine Algebra, Linz, Austria. http://hdl.handle.net/20.500.12708/85776 ( reposiTUm)

Pinsker, M. (2014). Algebraic and model theoretic methods in constraint satisfaction. Doc-Course Prag, Prag, Czechia. http://hdl.handle.net/20.500.12708/85924 ( reposiTUm)

Pinsker, M. (2014). Topological Birkhoff and Constraint Satisfaction. LIAFA, Automates et Applications Seminar, Paris, France. http://hdl.handle.net/20.500.12708/85932 ( reposiTUm)

Pinsker, M. (2014). Projective clone homomorphisms. STRUCO Meeting, Prag, Czechia. http://hdl.handle.net/20.500.12708/85925 ( reposiTUm)

Pinsker, M. (2014). Clones on Ramsey Structures. Konferenz Algebra and Clones Fest, Prag, Czechia. http://hdl.handle.net/20.500.12708/85915 ( reposiTUm)

Pinsker, M. (2014). Introduction to Constraint Satisfaction over infinite structures. Logic Seminar of the University of Colorado, Boulder, United States of America (the). http://hdl.handle.net/20.500.12708/85931 ( reposiTUm)

Pinsker, M. (2014). Decomposing function clones on infinite sets. Algebra Seminar at University of Colorado, Boulder, United States of America (the). http://hdl.handle.net/20.500.12708/85930 ( reposiTUm)

Pinsker, M. (2014). Constraint Satisfaction on infinite domains (tutorial). Workshop of Banff International Research Station- Algebraic and Model Theoretical Methods in Constraint Satisfaction, Banff, Canada. http://hdl.handle.net/20.500.12708/85927 ( reposiTUm)

Pinsker, M. (2014). Algebraic and model theoretic methods in constraint satisfaction. CUNY Logic Workshop, New York City, United States of America (the). http://hdl.handle.net/20.500.12708/85926 ( reposiTUm)

Pinsker, M. (2014). Reconstructing structures from their abstract clones. ASL North American Annual Meeting (Special Session on Universal Algebra and CSPs, Boulder, United States of America (the). http://hdl.handle.net/20.500.12708/85916 ( reposiTUm)

Pinsker, M. (2013). Reconstructing the topology of clones, Workshop on Homogeneous Structures. Workshop on Homogeneous Structures, Hausdorff Research Institute for Mathematics, Bonn, Germany. http://hdl.handle.net/20.500.12708/85734 ( reposiTUm)

Pinsker, M. (2013). Finitary aspects of reducts of homogeneous structures. Eötvös University, Budapest, Hungary. http://hdl.handle.net/20.500.12708/85735 ( reposiTUm)

Pinsker, M. (2013). Reconstructing omega-categorical structures from their clones. Oberseminar mathematische Logik, Universitaet Bonn, Bonn, Germany. http://hdl.handle.net/20.500.12708/85732 ( reposiTUm)

Pinsker, M. (2013). Topological Birkhoff and reconstructing the random graph. Hausdorff Research Institute for Mathematics, Bonn, Germany. http://hdl.handle.net/20.500.12708/85733 ( reposiTUm)

Pinsker, M. (2007). Cardinalities of intervals in the clone lattice. Algebra Seminar, E104, TU Wien, Austria. http://hdl.handle.net/20.500.12708/118279 ( reposiTUm)

Pinsker, M. (2007). Local clones containing the permutations. 73. Arbeitstagung Allgemeine Algebra, Klagenfurt, Austria, Austria. http://hdl.handle.net/20.500.12708/118278 ( reposiTUm)

Pinsker, M. (2007). The constraint satisfaction problem and local clones. Algebra Seminar, E104, TU Wien, Austria. http://hdl.handle.net/20.500.12708/118277 ( reposiTUm)

Pinsker, M. (2007). The reducts of (N,=). International Conference on Order, Algebra and Logics, OAL2007, Nashville, Tennessee, Non-EU. http://hdl.handle.net/20.500.12708/118282 ( reposiTUm)

Pinsker, M. (2007). Clones from ideals. 74. Arbeitstagung Allgemeine Algebra (AAA74), Tampere, Finland, EU. http://hdl.handle.net/20.500.12708/118281 ( reposiTUm)

Pinsker, M. (2007). Clones in universal algebra. Wissenswertes aus der Mathematik, TU Wien, Austria. http://hdl.handle.net/20.500.12708/118280 ( reposiTUm)

Pinsker, M. (2007). Applied algebra 2: reducts of relational structures, CSP and local clones. Algebra Seminar, E104, TU Wien, Austria. http://hdl.handle.net/20.500.12708/118283 ( reposiTUm)

Pinsker, M. (2007). Reducts of relational structures and local clones. Univerzita Karlova, Prag, Czech Republic, EU. http://hdl.handle.net/20.500.12708/118285 ( reposiTUm)

Pinsker, M. (2007). Clones I have met since 2004. Univerzita Karlova, Prag, Czech Republic, EU. http://hdl.handle.net/20.500.12708/118284 ( reposiTUm)

Pinsker, M. (2007). Applied algbra 3: further reducts of relational structures in the seminar of our institute. Algebra Seminar, E104, TU Wien, Austria. http://hdl.handle.net/20.500.12708/118287 ( reposiTUm)

Pinsker, M. (2007). Sublattices of the clone lattice. TU Graz, Austria. http://hdl.handle.net/20.500.12708/118286 ( reposiTUm)

Pinsker, M. (2006). Intervals of the clone lattice. Warsaw University of Technology, Warsaw, Poland, EU. http://hdl.handle.net/20.500.12708/117851 ( reposiTUm)

Pinsker, M. (2006). Algebraische Verbände sind Unterverbände von Klonverbänden. Wiener Algebra-Seminar, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/117850 ( reposiTUm)

Pinsker, M. (2006). Algebraic lattices are complete sublattices of the clone lattice over an infinite set. Conference on Lattice Theory, Budapest, Hungary, EU. http://hdl.handle.net/20.500.12708/117838 ( reposiTUm)

Pinsker, M. (2006). The minimal clones above the permutations. Arbeitstagung Allgemeine Algebra, Linz, Austria. http://hdl.handle.net/20.500.12708/117852 ( reposiTUm)

Pinsker, M. (2006). An introduction to clones. Humboldt Universität Berlin, Berlin, Germany. http://hdl.handle.net/20.500.12708/118030 ( reposiTUm)

Pinsker, M. (2005). The clone generated by all binary two-valued operations: An application of infinite to finite clone theory. Clone Theory and Discrete Mathematics, Research Institute of Mathematical Sciences, Kyoto, Japan, Non-EU. http://hdl.handle.net/20.500.12708/117856 ( reposiTUm)

Pinsker, M. (2005). The interval above the clone T2. Meiji University Tokyo, Tokyo, Japan, Non-EU. http://hdl.handle.net/20.500.12708/117858 ( reposiTUm)

Pinsker, M. (2005). A survey of clones on infinite sets. Clone Theory and Discrete Mathematics, Research Institute of Mathematical Sciences, Kyoto, Japan, Non-EU. http://hdl.handle.net/20.500.12708/117857 ( reposiTUm)

Pinsker, M. (2005). Monoids above the permutations. Conference on Universal Algebra and Lattice Theory, Szeged, Hungary, EU. http://hdl.handle.net/20.500.12708/117855 ( reposiTUm)

Pinsker, M. (2005). Monoids above the permutations. International Algebraic Conference, Ekaterinburg, Russia, Non-EU. http://hdl.handle.net/20.500.12708/117853 ( reposiTUm)

Pinsker, M. (2005). Lattices of order ideals as monoidal intervals. Novi Sad Algebraic Conference 05, Novi Sad, Serbia, Non-EU. http://hdl.handle.net/20.500.12708/117854 ( reposiTUm)

Pinsker, M. (2005). The clone lattice: Introduction and partition. International Christian´s University Tokyo, Tokyo, Japan, Non-EU. http://hdl.handle.net/20.500.12708/117859 ( reposiTUm)

Pinsker, M. (2004). Die maximalen symmetrischen Clones über einer abzählbaren Grundmenge. Institut für Diskrete Mathematik und Geometrie, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/117346 ( reposiTUm)

Pinsker, M. (2003). Clones on the natural numbers. 66th Workshop on General Algebra, Klagenfurt, Austria, Austria. http://hdl.handle.net/20.500.12708/116265 ( reposiTUm)

Marimon, P., & Pinsker, M. (2024). Minimal operations over permutation groups. arXiv. https://doi.org/10.48550/arXiv.2410.22060 ( reposiTUm)

Pinsker, M. (2016). Constraint satisfaction problems for reducts of homogeneous graphs. arXiv. https://doi.org/10.48550/arXiv.1602.05819 ( reposiTUm)

Pinsker, M. (2014). The universal homogeneous binary tree. arXiv. https://doi.org/10.48550/arXiv.1409.2170 ( reposiTUm)

Pinsker, M. (2013). Reconstructing the topology of clones (p. 29). arXiv. https://doi.org/10.48550/arXiv.1312.7699 ( reposiTUm)

Goldstern, M., & Pinsker, M. (2007). A survey of clones on infinite sets. arXiv. https://doi.org/10.48550/arXiv.0701030 ( reposiTUm)

Pinsker, M. (2008). [More clones on infinite sets] [Professorial Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184322 ( reposiTUm)