Thorsten Ehlers

activity

20142016

17

19

and

20

Inputs

7 citations · 7 across the 3 of their papers we have counts for

collaborators

3 papers

cs.OH2016

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…

cs.DM2015

New Bounds on Optimal Sorting Networks

Thorsten Ehlers, Mike Müller

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 p…

cs.DS2014★ 7 cited

Faster Sorting Networks for $17$ , $19$ and $20$ Inputs

Thorsten Ehlers, Mike Müller

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 p…

A Generalization of the Directed Graph Layering Problem

New Bounds on Optimal Sorting Networks

Faster Sorting Networks for 17, 19 and 20 Inputs

Faster Sorting Networks for $17$ , $19$ and $20$ Inputs