#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2013

2017

- This year (3)
- Last 5 years (12)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Thorsten Ehlers, Mike Müller
- CiE
- 2015

We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs these new networks are faster (i.e., they require less computation steps) than the previously known best networks. Therefore, we improve upon the known upper bounds for minimal depth sorting networks on 17, 19, and 20 channels. Furthermore, we show that our sorting… (More)

- Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka
- Developments in Language Theory
- 2014

Two words are called k-abelian equivalent, if they share the same multiplicities for all factors of length at most k. We present an optimal linear time algorithm for identifying all occurrences of factors in a text that are k-abelian equivalent to some pattern P . Moreover, an optimal algorithm for finding the largest k for which two words are k-abelian… (More)

- Thorsten Ehlers, Mike Müller
- ArXiv
- 2014

We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs these new networks are faster (i.e., they require less computation steps) than the previously known best networks. Therefore, we improve upon the known upper bounds for minimal depth sorting networks on 17, 19, and 20 channels. The networks were obtained using a… (More)

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. Search focuses first on the “outsides” of the network and then on the inner part. All previous works focus only on properties of the front end of networks and on how to apply these… (More)

- Thorsten Ehlers, Klaus Jansen
- 2013 15th International Symposium on Symbolic and…
- 2013

We present a robust EPTAS for scheduling on identical machines. The running time for adding one job is bounded by 2<sup>O((1/ε2)</sup> log<sup>3(1/ε))</sup>. The migration factor required to gain a (1+ ε)-approximate schedule in each iteration is bounded by 2<sup>O((1/ε) log2(1/ε))</sup>.

- Thorsten Ehlers, Peter J. Stuckey
- CPAIOR
- 2016

- Max Bannach, Sebastian Berndt, Thorsten Ehlers
- SEA
- 2017

While the theoretical aspects concerning the computation of tree width – one of the most important graph parameters – are well understood, it is not clear how it can be computed practically. We present the open source Java library Jdrasil that implements several different state of the art algorithms for this task. By experimentally comparing these… (More)

- Thorsten Ehlers
- Inf. Process. Lett.
- 2017

- Ulf Rüegg, Thorsten Ehlers, Miro Spönemann, Reinhard von Hanxleden
- Graph Drawing
- 2016

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 preprocessing step is used that solves the Feedback Arc Set Problem (FASP) to make the graph acyclic before a layering is determined. Here we present the Generalized Layering Problem… (More)

- Thorsten Ehlers, Dirk Nowotka, Philipp Sieweck, Johannes Traub
- Software Engineering
- 2014