Bernd Steinbach
Bernd Steinbach has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Christian Posthoff
St. Augustine Campus
9 shared publications - Christian Posthoff
The University of the West Indies
6 shared publications - Christian Lang
IMMS gGmbH Erfurt
4 shared publications Christian Posthoff
The University of the West Indies
3 shared publications- Matthias Werner
TU Chemnitz
1 shared publication
Latest Publications
- 1 August 2024
- Published by Walter de Gruyter GmbH in it - Information Technology
- Vol. 66 (4-5) , 159-173
Rectangle-free four-colored square grids realized by cyclic-rotated reusable patterns
This paper deals with the very hard problem of grid coloring that has been specified more than 10 years ago in S. Fenner et al., Rectangle Free Coloring of Grids, 2009. Available at: http://www.cs.umd.edu/∼gasarch/papers/grid.pdf. It was unknown whether rectangle-free completely four-colored square grids of sizes 17 × 17 and 18 × 18 exist. As result of an extensive research I computed commonly with Christian Posthoff a rectangle-free pattern that can be reused cyclic-rotated by 90° for the four colors of the grid of size 18 × 18 (B. Steinbach and C. Posthoff, “Extremely complex 4-colored rectangle-free grids: solution of open multiple-valued problems,” in Proceedings of the IEEE 42nd International Symposium on Multiple-Valued Logic, Victoria, BC, Canada, ISMVL, 2012, pp. 37–44, B. Steinbach and C. Posthoff, “Rectangle-free colorings of extremely complex grids using 4 colors,” J. Mult.-Valued Log. Soft Comput., vol. 21, nos. 5–6, pp. 609–625, 2013). A similar solution for the grid of size 17 × 17 has not been found so far. We explore in this paper for which sizes of square grids rectangle-free four-colored patterns exist, at which the pattern of one color can be reused for another color after a rotation by 90°.
- 1 August 2024
- Published by Walter de Gruyter GmbH in it - Information Technology
- Vol. 66 (4-5) , 159-173
Rectangle-free four-colored square grids realized by cyclic-rotated reusable patterns
This paper deals with the very hard problem of grid coloring that has been specified more than 10 years ago in S. Fenner et al., Rectangle Free Coloring of Grids, 2009. Available at: http://www.cs.umd.edu/∼gasarch/papers/grid.pdf. It was unknown whether rectangle-free completely four-colored square grids of sizes 17 × 17 and 18 × 18 exist. As result of an extensive research I computed commonly with Christian Posthoff a rectangle-free pattern that can be reused cyclic-rotated by 90° for the four colors of the grid of size 18 × 18 (B. Steinbach and C. Posthoff, “Extremely complex 4-colored rectangle-free grids: solution of open multiple-valued problems,” in Proceedings of the IEEE 42nd International Symposium on Multiple-Valued Logic, Victoria, BC, Canada, ISMVL, 2012, pp. 37–44, B. Steinbach and C. Posthoff, “Rectangle-free colorings of extremely complex grids using 4 colors,” J. Mult.-Valued Log. Soft Comput., vol. 21, nos. 5–6, pp. 609–625, 2013). A similar solution for the grid of size 17 × 17 has not been found so far. We explore in this paper for which sizes of square grids rectangle-free four-colored patterns exist, at which the pattern of one color can be reused for another color after a rotation by 90°.
- 24 February 2023
- Published by Springer Nature
- p. 135-154
Thirty-Six Officers of Euler-New Insights Computed Using XBOOLE
- 24 February 2023
- Published by Springer Nature
- p. 135-154
Thirty-Six Officers of Euler-New Insights Computed Using XBOOLE
- 25 January 2021
- Published by Springer Nature
- p. 59-81
Fast Optimal Synthesis of Symmetric Index Generation Functions
- 25 January 2021
- Published by Springer Nature
- p. 59-81
Fast Optimal Synthesis of Symmetric Index Generation Functions
- 9 July 2019
- Published by Springer Nature
- p. 51-82
Derivative Operations for Classes C N $\mathcal {C}_N$ of Boolean Functions- 9 July 2019
- Published by Springer Nature
- p. 51-82
Derivative Operations for Classes C N $\mathcal {C}_N$ of Boolean Functions- Open Access
- 1 June 2018
- Published by National Library of Serbia in Facta universitatis - series: Electronics and Energetics
- Vol. 31 (2) , 223-240
COMPACT XOR-BI-DECOMPOSITION FOR LATTICES OF BOOLEAN FUNCTIONS
Bi-Decomposition is a powerful approach for the synthesis of multi-level combinational circuits because it utilizes the properties of the given functions to find small circuits, with low power consumption and low delay. Compact bi-decompositions restrict the variables in the support of the decomposition functions as much as possible. Methods to find compact AND-, OR-, or XOR-bi-decompositions for a given completely specified function are well known. Lattices of Boolean Functions significantly increase the possibilities to synthesize a minimal circuit. However, so far only methods to find compact AND- or OR-bidecompositions for lattices of Boolean functions are known. This gap, i.e., a method to find a compact XOR-bi-decomposition for a lattice of Boolean functions, has been closed by the approach suggested in this paper.
- 1 June 2018
- Published by National Library of Serbia in Facta universitatis - series: Electronics and Energetics
- Vol. 31 (2) , 223-240
Open AccessCOMPACT XOR-BI-DECOMPOSITION FOR LATTICES OF BOOLEAN FUNCTIONS
Bi-Decomposition is a powerful approach for the synthesis of multi-level combinational circuits because it utilizes the properties of the given functions to find small circuits, with low power consumption and low delay. Compact bi-decompositions restrict the variables in the support of the decomposition functions as much as possible. Methods to find compact AND-, OR-, or XOR-bi-decompositions for a given completely specified function are well known. Lattices of Boolean Functions significantly increase the possibilities to synthesize a minimal circuit. However, so far only methods to find compact AND- or OR-bidecompositions for lattices of Boolean functions are known. This gap, i.e., a method to find a compact XOR-bi-decomposition for a lattice of Boolean functions, has been closed by the approach suggested in this paper.
- 26 January 2018
- Published by Springer Nature
- p. 238-245
A Three-Level Hierarchy of Models for Lattices of Boolean Functions
- 26 January 2018
- Published by Springer Nature
- p. 238-245
A Three-Level Hierarchy of Models for Lattices of Boolean Functions
- 21 October 2016
- Published by Springer Nature
- p. 251-264
From Boolean to Multi-valued Bent Functions
- 17 December 2015
- Published by Springer Nature
- p. 617-624
Evaluation and Optimization of GPU Based Unate Covering Algorithms
- 17 December 2015
- Published by Springer Nature
- p. 617-624
Evaluation and Optimization of GPU Based Unate Covering Algorithms
- 11 March 2015
- Published by Springer Nature
- p. 17-31
Alternative Approaches for Fast Boolean Calculations Using the GPU
- 11 March 2015
- Published by Springer Nature
- p. 17-31
Alternative Approaches for Fast Boolean Calculations Using the GPU
- 1 September 2014
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 37 (3) , 169-177
How to Solve Bishop-Problems
The University of The West Indies, St. Augustine Campus, Trinidad and Tobago. email: christian@posthoff.de Freiberg University of Mining and Technology, Institute of Computer Science, D-09596 Freiberg, Germany. email: steinb@informatik.tu-freiberg.de
- 1 September 2014
- Published by SAGE Publications in ICGA Journal: The Journal of the Computer Games Community
- Vol. 37 (3) , 169-177
How to Solve Bishop-Problems
The University of The West Indies, St. Augustine Campus, Trinidad and Tobago. email: christian@posthoff.de Freiberg University of Mining and Technology, Institute of Computer Science, D-09596 Freiberg, Germany. email: steinb@informatik.tu-freiberg.de