Reinhard Pöschel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2021

The Structure of the Maximal Congruence Lattices of Algebras on a Finite SetDanica Jakubíková-Studenovská, Reinhard Pöschel, Sándor Radeleczki. mvl, 36(4-5):299-320, 2021. [doi]

2020

Centralising groups of semiprojections and near unanimity operationsMike Behrisch, Reinhard Pöschel. ismvl 2020: 291-296 [doi]

2017

Dynamical Systems in CategoriesMike Behrisch, Sebastian Kerkhoff, Reinhard Pöschel, Friedrich Martin Schneider, Stefan Siegmund. acs, 25(1):29-57, 2017. [doi]

2014

A Short Introduction to ClonesSebastian Kerkhoff, Reinhard Pöschel, Friedrich Martin Schneider. ENTCS, 303:107-120, 2014. [doi]

2011

The Lattice of Compatible Quasiorders of Acyclic Monounary AlgebrasDanica Jakubíková-Studenovská, Reinhard Pöschel, Sándor Radeleczki. order, 28(3):481-497, 2011. [doi]

2010

Compositions and Clones of Boolean FunctionsReinhard Pöschel, Ivo G. Rosenberg, Yves Crama, Peter L. Hammer. In Yves Crama, Peter L. Hammer, editors, Boolean Models and Methods in Mathematics, Computer Science, and Engineering. pages 3-38, Cambridge University Press, 2010. [doi]

2006

The Teridentity and Peircean Algebraic LogicJoachim Hereth Correia, Reinhard Pöschel. iccS 2006: 229-246 [doi]

2004

The Power of Peircean Algebraic Logic (PAL)Joachim Hereth Correia, Reinhard Pöschel. icfca 2004: 337-351 [doi]

Relationally defined clones of tree functions closed under selection or primitive recursionReinhard Pöschel, Alexander Semigrodskikh, Heiko Vogler. actaC, 16(3):411-425, 2004. [doi]

2000

Counting circulant graphs of prime-power order by decomposing into orbit enumeration problemsValery A. Liskovets, Reinhard Pöschel. DM, 214(1-3):173-191, 2000. [doi]

Non-Cayley-isomorphic self-complementary circulant graphsValery A. Liskovets, Reinhard Pöschel. jgt, 34(2):128-141, 2000. [doi]

1999

The isomorphism problem for circulant graphs via Schur ring theoryMikhail E. Muzychuk, Mikhail H. Klin, Reinhard Pöschel. dimacs 2001: 241-264

1994

Power GraphsUlrike Baumann, Reinhard Pöschel, Irmgard Schmeichel. eik, 30(3):135-142, 1994.

1993

Power algebras: clones and relationsJ. Brunner, Th. Drescher, Reinhard Pöschel, H. Seidel. eik, 29(5):293-302, 1993.

1992

Rectangular AlgebrasReinhard Pöschel, M. Reichel. ismvl 1992: 255-260

1991

A Note on Minimal Partial ClonesFerdinand Börner, Lucien Haddad, Reinhard Pöschel. ismvl 1991: 262-267

1989

The Equational Logic For Graph AlgebrasReinhard Pöschel. mlq, 35(3):273-282, 1989. [doi]

1988

Realization of sets of permutations by permutation networksReinhard Pöschel, F. Wächter, Ferdinand Börner. parcella 1989: 326-331

1986

Zur Darstellung und Behandlung algebraisch-kombinatorischer ObjekteLev A. Kaloujnine, Reinhard Pöschel. eik, 22(1):5-24, 1986.

1985

Sets of Permutations and Their Realization by Permutation NetworksFerdinand Börner, Reinhard Pöschel, Michael Gössel. eik, 21(7/8):331-342, 1985.

1980

Invariant Relations for Automata - A ProposalMichael Gössel, Reinhard Pöschel. eik, 16(4):147-169, 1980.

1977

On the Characterization of Linear and Linearizable Automata by a Superposition PrincipleMichael Gössel, Reinhard Pöschel. mst, 11:61-76, 1977.

1975

Zur Charakterisierung spezieller superpositionsabgeschlossener Funktionenklassen, die der Durchschnitt einer absteigenden Kette sind, durch invariante RelationenReinhard Pöschel. eik, 11(10-12):703-708, 1975.

Sign in or sign up to see more results.

runs on WebDSL