default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMike Behrisch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Asma'a Almazaydeh
, Mike Behrisch, Edith Vargas-García, Andreas Wachtel:
Arrow relations in lattices of integer partitions. Int. J. Approx. Reason. 172: 109244 (2024)- [c14]Mike Behrisch:
Weak Bases for All Maximal Clones. ISMVL 2024: 7-12 - 2023
- [j10]Mike Behrisch:
On Weak Bases for Boolean Relational Clones and Reductions for Computational Problems. FLAP 10(6): 1059-1103 (2023) - [c13]Mike Behrisch, Leon Renkin:
Computing Witnesses for Centralising Monoids on a Three-Element Set. ICFCA 2023: 109-126 - [c12]Mike Behrisch:
Weak bases for maximal clones. ISMVL 2023: 128-133 - 2022
- [j9]Mike Behrisch:
All Centralising Monoids with Majority Witnesses on a Four-element Set. J. Multiple Valued Log. Soft Comput. 38(1-2): 23-56 (2022) - [c11]Mike Behrisch:
Weak bases for Boolean relational clones revisited. ISMVL 2022: 68-73 - 2021
- [j8]Mike Behrisch, Edith Vargas-García:
Centralising Monoids with Low-Arity Witnesses on a Four-Element Set. Symmetry 13(8): 1471 (2021) - [c10]Mike Behrisch, Alain Chavarri Villarello, Edith Vargas-García:
Representing Partition Lattices Through FCA. ICFCA 2021: 3-19 - [c9]Mike Behrisch:
Centralising monoids with conservative majority operations as witnesses. ISMVL 2021: 56-61 - 2020
- [c8]Mike Behrisch, Reinhard Pöschel:
Centralising groups of semiprojections and near unanimity operations. ISMVL 2020: 291-296 - [c7]Mike Behrisch, Hajime Machida:
On Minimality of Some Binary Clones Related to Unary Functions. ISMVL 2020: 297-302
2010 – 2019
- 2019
- [j7]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
Minimal Distance of Propositional Models. Theory Comput. Syst. 63(6): 1131-1184 (2019) - [j6]Mike Behrisch, Edith Vargas-García, Dmitriy Zhuk:
The Number of Clones Determined by Disjunctions of Unary Relations. Theory Comput. Syst. 63(6): 1298-1313 (2019) - [c6]Mike Behrisch, Hajime Machida:
An Approach Toward Classification of Minimal Groupoids on a Finite Set. ISMVL 2019: 164-169 - 2017
- [j5]Mike Behrisch, Sebastian Kerkhoff, Reinhard Pöschel, Friedrich Martin Schneider, Stefan Siegmund:
Dynamical Systems in Categories. Appl. Categorical Struct. 25(1): 29-57 (2017) - [j4]Mike Behrisch, John Kenneth Truss, Edith Vargas-García:
Reconstructing the Topology on Monoids and Polymorphism Clones of the Rationals. Stud Logica 105(1): 65-91 (2017) - 2016
- [c5]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
The Next Whisky Bar. CSR 2016: 41-56 - [c4]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
As Close as It Gets. WALCOM 2016: 222-235 - 2015
- [c3]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
Give Me Another One! ISAAC 2015: 664-676 - [i1]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
Minimal Distance of Propositional Models. CoRR abs/1502.06761 (2015) - 2013
- [j3]Friedrich Martin Schneider, Sebastian Kerkhoff, Mike Behrisch, Stefan Siegmund:
Locally Compact Groups admitting Faithful Strongly Chaotic Actions on Hausdorff Spaces. Int. J. Bifurc. Chaos 23(9) (2013) - [c2]Mike Behrisch:
Clones with Nullary Operations. WACT 2013: 3-35 - 2012
- [j2]Mike Behrisch:
Irreducible Subalgebra Primal Algebras. Order 29(2): 231-244 (2012) - [j1]Mike Behrisch, Miguel Couceiro, Keith A. Kearnes, Erkko Lehtonen, Ágnes Szendrei:
Commuting Polynomial Operations of Distributive Lattices. Order 29(2): 245-269 (2012) - [c1]Mike Behrisch, Sebastian Kerkhoff, John Power:
Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What? MFPS 2012: 5-16
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-10-07 22:13 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:
