Dietmar Ebner

TL;DR: In this article, the authors present an integer linear programming (ILP) approach to compute the crossing number of general sparse graphs of moderate size, and present computational results on a popular benchmark set of graphs.

TL;DR: This work presents a new structural architecture description language (ADL) that is used to derive the architecture dependent components of a compiler backend - most notably an instruction selector based on tree pattern matching that is combined with gcc, thereby opening up the way for a large number of readily available high level optimizations.

TL;DR: A new force-based simulated annealing algorithm is presented to heuristically solve the NP-hard label number maximization problem lnm and a very thorough experimental comparison of the best known labeling methods on widely used benchmark sets shows that the new algorithm outperforms the other methods in terms of quality while still being reasonably fast.

TL;DR: An effective if-conversion algorithm for the CHILI - a novel hardware architecture specifically designed for digital video processing and mobile multimedia consumer electronic that achieves a speedup of 21% in comparison to the existing code generator based on gcc.