default search action
Bernd Steinbach
Person information
- affiliation: TU Bergakademie Freiberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [b5]Christian Posthoff, Bernd Steinbach:
Logic Functions and Equations - Binary Models for Computer Science, Second Edition. Springer 2019, ISBN 978-3-030-02419-2, pp. 1-508 - 2017
- [b4]Bernd Steinbach, Christian Posthoff:
Boolean Differential Calculus. Synthesis Lectures on Digital Circuits and Systems, Morgan & Claypool Publishers 2017, ISBN 978-3-031-79891-7 - [c21]Bernd Steinbach, Christian Posthoff:
A Three-Level Hierarchy of Models for Lattices of Boolean Functions. EUROCAST (2) 2017: 238-245 - 2016
- [c20]Bernd Steinbach, Stefan Heinrich, Christian Posthoff:
Multi-valued Problem Solvers. ISMVL 2016: 264-269 - 2015
- [j7]Bernd Steinbach, Christian Posthoff:
Highly Complex 4-Colored Rectangle-free Grids - Solution Unsolved Multiple-Valued Problems. J. Multiple Valued Log. Soft Comput. 24(1-4): 369-404 (2015) - [j6]Bernd Steinbach, Christian Posthoff:
The Last Unsolved Four-Colored Rectangle-Free Grid: The Solution ofExtremely Complex Multiple-Valued Problems. J. Multiple Valued Log. Soft Comput. 25(4-5): 461-490 (2015) - [c19]Bernd Steinbach, Christian Posthoff:
Evaluation and Optimization of GPU Based Unate Covering Algorithms. EUROCAST 2015: 617-624 - [p1]Bernd Steinbach, Matthias Werner:
Alternative Approaches for Fast Boolean Calculations Using the GPU. Computational Intelligence and Efficiency in Engineering Systems 2015: 17-31 - 2014
- [j5]Christian Posthoff, Bernd Steinbach:
Solving the Game of Sudoku. J. Int. Comput. Games Assoc. 37(2): 111-116 (2014) - [j4]Christian Posthoff, Bernd Steinbach:
How to Solve Bishop-Problems. J. Int. Comput. Games Assoc. 37(3): 169-177 (2014) - [c18]Bernd Steinbach:
Simpler Functions for Decompositions. ICSEng 2014: 817-823 - [c17]Bernd Steinbach, Christian Posthoff:
Multiple-Valued Problem Solvers - Comparison of Several Approaches. ISMVL 2014: 25-31 - 2013
- [b3]Bernd Steinbach, Christian Posthoff:
Boolean Differential Equations. Synthesis Lectures on Digital Circuits and Systems, Morgan & Claypool Publishers 2013, ISBN 9781627052412, pp. 1-158 - [j3]Bernd Steinbach, Christian Posthoff:
Rectangle-Free Colorings of Extremely Complex Grids Using 4 Colors. J. Multiple Valued Log. Soft Comput. 21(5-6): 609-625 (2013) - [c16]Bernd Steinbach, Christian Posthoff:
Fast Calculation of Exact Minimal Unate Coverings on Both the CPU and the GPU. EUROCAST (2) 2013: 234-241 - [c15]Bernd Steinbach, Christian Posthoff:
Artificial Intelligence and Creativity - Two Requirements to Solve an Extremely Complex Coloring Problem. ICAART (2) 2013: 411-418 - [c14]Bernd Steinbach, Christian Posthoff:
Solution of the Last Open Four-Colored Rectangle-Free Grid: An Extremely Complex Multiple-Valued Problem. ISMVL 2013: 302-309 - 2012
- [c13]Bernd Steinbach, Christian Posthoff:
Extremely Complex 4-Colored Rectangle-Free Grids: Solution of Open Multiple-Valued Problems. ISMVL 2012: 37-44 - 2011
- [c12]Bernd Steinbach, Christian Posthoff:
Improvements of the Construction of Exact Minimal Covers of Boolean Functions. EUROCAST (2) 2011: 272-279 - 2010
- [c11]Christian Posthoff, Bernd Steinbach:
The Solution of Discrete Constraint Problems using Boolean Models - The Use of Ternary Vectors for Parallel SAT-Solving. ICAART (1) 2010: 487-493 - [c10]Dong Liang, Bernd Steinbach:
A New General Approach to Model Event Handling. ICSEA 2010: 14-19
2000 – 2009
- 2009
- [c9]Bernd Steinbach, Christian Posthoff:
Complete Sets of Hamiltonian Circuits for Classification of Documents. EUROCAST 2009: 526-533 - 2005
- [c8]Bernd Steinbach, Christian Lang:
Complete Bi-Decomposition of Multiple-Valued Functions Using MIN and MAX Gates. ISMVL 2005: 69-74 - 2004
- [c7]Thomas Beierlein, Dominik Fröhlich, Bernd Steinbach:
A Model-Based Approach to System-Level Co-Design. MBMV 2004: 86-95 - 2003
- [j2]Christian Lang, Bernd Steinbach:
Bi-Decomposition of Function Sets in Multiple-Valued Logic for Circuit Design and Data Mining. Artif. Intell. Rev. 20(3-4): 233-267 (2003) - [j1]Bernd Steinbach, Christian Lang:
Exploiting Functional Properties of Boolean Functions for Optimal Multi-Level Design by Bi-Decomposition. Artif. Intell. Rev. 20(3-4): 319-360 (2003) - [c6]Dominik Fröhlich, Bernd Steinbach, Thomas Beierlein:
UML-Based Co-Design for Run-Time Reconfigurable Architectures. FDL 2003: 285-297 - 2001
- [c5]Alan Mishchenko, Bernd Steinbach, Marek A. Perkowski:
An Algorithm for Bi-Decomposition of Logic Functions. DAC 2001: 103-108 - [c4]Christian Lang, Bernd Steinbach:
Decomposition of Multi-Valued Functions into Min- and Max-Gates. ISMVL 2001: 173-180
1990 – 1999
- 1999
- [c3]Bernd Steinbach, Marek A. Perkowski, Christian Lang:
Bi-Decompositions of Multi-Valued Functions for Circuit Design and Data Mining Applications. ISMVL 1999: 50-58 - 1994
- [c2]Bernd Steinbach, M. Stöckert:
Design of fully testable circuits by functional decomposition and implicit test pattern generation. VTS 1994: 22-27 - 1990
- [c1]Bernd Steinbach, Nico Kümmling:
Effiziente Lösung hochdimensionaler BOOLEscher Probleme mittels XBOOLE auf Transputer. Transputer-Anwender-Treffen 1990: 127-134
1980 – 1989
- 1984
- [b2]Bernd Steinbach:
Theorie, Algorithmen und Programme für den rechnergestützten logischen Entwurf digitaler Systeme. Technische Hochschule Karl-Marx-Stadt, Germany, 1984 - 1980
- [b1]Bernd Steinbach:
Lösung binärer Differentialgleichungen und ihre Anwendung auf binäre Systeme. Technische Hochschule Karl-Marx-Stadt, Germany, 1980
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-25 05:49 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: