Zur Charakterisierung spezieller superpositionsabgeschlossener Funktionenklassen, die der Durchschnitt einer absteigenden Kette sind, durch invariante Relationen. - Reinhard Pöschel (J. Inf. Process. Cybern., 1975)

On the Characterization of Linear and Linearizable Automata by a Superposition Principle. - Michael Gössel; Reinhard Pöschel (Math. Syst. Theory, 1977)

Invariant Relations for Automata - A Proposal. - Michael Gössel; Reinhard Pöschel (J. Inf. Process. Cybern., 1980)

Sets of Permutations and Their Realization by Permutation Networks. - Ferdinand Börner; Reinhard Pöschel; Michael Gössel (J. Inf. Process. Cybern., 1985)

Zur Darstellung und Behandlung algebraisch-kombinatorischer Objekte. - Lev A. Kaloujnine; Reinhard Pöschel (J. Inf. Process. Cybern., 1986)

Realization of sets of permutations by permutation networks. - Reinhard Pöschel; Friedmar Wächter; Ferdinand Börner (Parcella, 1988)

The Equational Logic For Graph Algebras. - Reinhard Pöschel (Math. Log. Q., 1989)

A Note on Minimal Partial Clones. - Ferdinand Börner; Lucien Haddad; Reinhard Pöschel (ISMVL, 1991)

Rectangular Algebras. - Reinhard Pöschel; M. Reichel (ISMVL, 1992)

Power algebras: clones and relations. - J. Brunner; Th. Drescher; Reinhard Pöschel; H. Seidel (J. Inf. Process. Cybern., 1993)

Power Graphs. - Ulrike Baumann; Reinhard Pöschel; Irmgard Schmeichel (J. Inf. Process. Cybern., 1994)

The isomorphism problem for circulant graphs via Schur ring theory. - Mikhail E. Muzychuk; Mikhail H. Klin; Reinhard Pöschel (Codes and Association Schemes, 1999)

Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems. - Valery A. Liskovets; Reinhard Pöschel (Discret. Math., 2000)

Non-Cayley-isomorphic self-complementary circulant graphs. - Valery A. Liskovets; Reinhard Pöschel (J. Graph Theory, 2000)

The Power of Peircean Algebraic Logic (PAL). - Joachim Hereth Correia; Reinhard Pöschel (ICFCA, 2004)

Relationally defined clones of tree functions closed under selection or primitive recursion. - Reinhard Pöschel; Alexander Semigrodskikh; Heiko Vogler (Acta Cybern., 2004)

The Teridentity and Peircean Algebraic Logic. - Joachim Hereth Correia; Reinhard Pöschel (ICCS, 2006)

Compositions and Clones of Boolean Functions. - Reinhard Pöschel; Ivo G. Rosenberg; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

The Lattice of Compatible Quasiorders of Acyclic Monounary Algebras. - Danica Jakubíková-Studenovská; Reinhard Pöschel; Sándor Radeleczki (Order, 2011)

A Short Introduction to Clones. - Sebastian Kerkhoff; Reinhard Pöschel; Friedrich Martin Schneider (WACT, 2013)

Dynamical Systems in Categories. - Mike Behrisch; Sebastian Kerkhoff; Reinhard Pöschel; Friedrich Martin Schneider; Stefan Siegmund (Appl. Categorical Struct., 2017)

Centralising groups of semiprojections and near unanimity operations. - Mike Behrisch; Reinhard Pöschel (ISMVL, 2020)

The Structure of the Maximal Congruence Lattices of Algebras on a Finite Set. - Danica Jakubíková-Studenovská; Reinhard Pöschel; Sándor Radeleczki (J. Multiple Valued Log. Soft Comput., 2021)