23 citations · 59 across the 13 of their papers we have counts for
14 papers
Scalable Flow Simulations with the Lattice Boltzmann Method
Markus Holzer, Jayesh Badwaik, Radim Vavrik +7
The primary goal of the EuroHPC JU project SCALABLE is to develop an industrial Lattice Boltzmann Method (LBM)-based computational fluid dynamics (CFD) solver capable of exploiting…
On the Accepting State Complexity of Operations on Permutation Automata
Christian Rauch, Markus Holzer
We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations to languages accepted by p…
Comparison of free-surface and conservative Allen-Cahn phase-field lattice Boltzmann method
Christoph Schwarzmeier, Markus Holzer, Travis Mitchell +3
This study compares the free-surface lattice Boltzmann method (FSLBM) with the conservative Allen-Cahn phase-field lattice Boltzmann method (PFLBM) in their ability to model two-ph…
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann +4
In the Intersection Non-Emptiness problem, we are given a list of finite automata over a common alphabet as input, and the goal is to determine whether some…
Input-Driven Double-Head Pushdown Automata
Markus Holzer, Martin Kutrib, Andreas Malcher +1
We introduce and study input-driven deterministic and nondeterministic double-head pushdown automata. A double-head pushdown automaton is a slight generalization of an ordinary pus…
On the Descriptional Complexity of Operations on Semilinear Sets
Simon Beier, Markus Holzer, Martin Kutrib
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and…