31 citations · 38 across the 5 of their papers we have counts for
7 papers
On Solving Word Equations Using SAT
Joel D. Day, Thorsten Ehlers, Mitja Kulczynski +3
We present Woorpje, a string solver for bounded word equations (i.e., equations where the length of each variable is upper bounded by a given integer). Our algorithm works by refor…
On Modelling the Avoidability of Patterns as CSP
Thorsten Ehlers, Florin Manea, Dirk Nowotka +1
Solving avoidability problems in the area of string combinatorics often requires, in an initial step, the construction, via a computer program, of a very long word that does not co…
Estimating Latencies of Task Sequences in Multi-Core Automotive ECUs
Max J. Friese, Thorsten Ehlers, Dirk Nowotka
The computation of a cyber-physical system's reaction to a stimulus typically involves the execution of several tasks. The delay between stimulus and reaction thus depends on the i…
A Generalization of the Directed Graph Layering Problem
Ulf Rüegg, Thorsten Ehlers, Miro Spönemann +1
The Directed Layering Problem (DLP) solves a step of the widely used layer-based approach to automatically draw directed acyclic graphs. To cater for cyclic graphs, usually a prepr…
Sorting Networks: to the End and Back Again
Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers +2
This paper studies new properties of the front and back ends of a sorting network, and illustrates the utility of these in the search for new bounds on optimal sorting networks. Se…
New Bounds on Optimal Sorting Networks
Thorsten Ehlers, Mike Müller
We present new parallel sorting networks for to inputs. For and inputs these new networks are faster (i.e., they require less computation steps) than the p…