default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReinhard Pöschel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Danica Jakubíková-Studenovská, Reinhard Pöschel, Sándor Radeleczki:
The Structure of the Maximal Congruence Lattices of Algebras on a Finite Set. J. Multiple Valued Log. Soft Comput. 36(4-5): 299-320 (2021)- 2020
- [c8]Mike Behrisch
, Reinhard Pöschel:
Centralising groups of semiprojections and near unanimity operations. ISMVL 2020: 291-296
2010 – 2019
- 2017
- [j13]Mike Behrisch, Sebastian Kerkhoff, Reinhard Pöschel, Friedrich Martin Schneider, Stefan Siegmund:
Dynamical Systems in Categories. Appl. Categorical Struct. 25(1): 29-57 (2017) - 2013
- [c7]Sebastian Kerkhoff, Reinhard Pöschel, Friedrich Martin Schneider:
A Short Introduction to Clones. WACT 2013: 107-120 - 2011
- [j12]Danica Jakubíková-Studenovská, Reinhard Pöschel, Sándor Radeleczki:
The Lattice of Compatible Quasiorders of Acyclic Monounary Algebras. Order 28(3): 481-497 (2011) - 2010
- [p1]Reinhard Pöschel, Ivo G. Rosenberg, Yves Crama, Peter L. Hammer:
Compositions and Clones of Boolean Functions. Boolean Models and Methods 2010: 3-38
2000 – 2009
- 2006
- [c6]Joachim Hereth Correia, Reinhard Pöschel:
The Teridentity and Peircean Algebraic Logic. ICCS 2006: 229-246 - 2004
- [j11]Reinhard Pöschel, Alexander Semigrodskikh, Heiko Vogler:
Relationally defined clones of tree functions closed under selection or primitive recursion. Acta Cybern. 16(3): 411-425 (2004) - [c5]Joachim Hereth Correia, Reinhard Pöschel:
The Power of Peircean Algebraic Logic (PAL). ICFCA 2004: 337-351 - 2000
- [j10]Valery A. Liskovets, Reinhard Pöschel:
Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems. Discret. Math. 214(1-3): 173-191 (2000) - [j9]Valery A. Liskovets, Reinhard Pöschel:
Non-Cayley-isomorphic self-complementary circulant graphs. J. Graph Theory 34(2): 128-141 (2000)
1990 – 1999
- 1999
- [c4]Mikhail E. Muzychuk, Mikhail H. Klin, Reinhard Pöschel:
The isomorphism problem for circulant graphs via Schur ring theory. Codes and Association Schemes 1999: 241-264 - 1994
- [j8]Ulrike Baumann, Reinhard Pöschel, Irmgard Schmeichel:
Power Graphs. J. Inf. Process. Cybern. 30(3): 135-142 (1994) - 1993
- [j7]J. Brunner, Th. Drescher, Reinhard Pöschel, H. Seidel:
Power algebras: clones and relations. J. Inf. Process. Cybern. 29(5): 293-302 (1993) - 1992
- [c3]Reinhard Pöschel, M. Reichel:
Rectangular Algebras. ISMVL 1992: 255-260 - 1991
- [c2]Ferdinand Börner, Lucien Haddad, Reinhard Pöschel:
A Note on Minimal Partial Clones. ISMVL 1991: 262-267
1980 – 1989
- 1989
- [j6]Reinhard Pöschel:
The Equational Logic For Graph Algebras. Math. Log. Q. 35(3): 273-282 (1989) - 1988
- [c1]Reinhard Pöschel, Friedmar Wächter, Ferdinand Börner:
Realization of sets of permutations by permutation networks. Parcella 1988: 326-331 - 1986
- [j5]Lev A. Kaloujnine, Reinhard Pöschel:
Zur Darstellung und Behandlung algebraisch-kombinatorischer Objekte. J. Inf. Process. Cybern. 22(1): 5-24 (1986) - 1985
- [j4]Ferdinand Börner, Reinhard Pöschel, Michael Gössel:
Sets of Permutations and Their Realization by Permutation Networks. J. Inf. Process. Cybern. 21(7/8): 331-342 (1985) - 1980
- [j3]Michael Gössel, Reinhard Pöschel:
Invariant Relations for Automata - A Proposal. J. Inf. Process. Cybern. 16(4): 147-169 (1980)
1970 – 1979
- 1977
- [j2]Michael Gössel, Reinhard Pöschel:
On the Characterization of Linear and Linearizable Automata by a Superposition Principle. Math. Syst. Theory 11: 61-76 (1977) - 1975
- [j1]Reinhard Pöschel:
Zur Charakterisierung spezieller superpositionsabgeschlossener Funktionenklassen, die der Durchschnitt einer absteigenden Kette sind, durch invariante Relationen. J. Inf. Process. Cybern. 11(10-12): 703-708 (1975)
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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 2024-04-24 23:00 CEST 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:
