Online-Scheduling on Identical Machines with Bounded Migration. - Thorsten Ehlers; Klaus Jansen (SYNASC, 2013)

Communication in Massively-Parallel SAT Solving. - Thorsten Ehlers; Dirk Nowotka; Philipp Sieweck (ICTAI, 2014)

Formal software verification for the migration of embedded code from single- to multicore systems. - Thorsten Ehlers; Dirk Nowotka; Philipp Sieweck; Johannes Traub (Software Engineering, 2014)

Faster Sorting Networks for $17$, $19$ and $20$ Inputs. - Thorsten Ehlers; Mike Müller (CoRR, 2014)

New Bounds on Optimal Sorting Networks. - Thorsten Ehlers; Mike Müller (CiE, 2015)

k-Abelian pattern matching. - Thorsten Ehlers; Florin Manea; Robert Mercas; Dirk Nowotka (J. Discrete Algorithms, 2015)

Parallelizing Constraint Programming with Learning. - Thorsten Ehlers; Peter J. Stuckey (CPAIOR, 2016)

A Generalization of the Directed Graph Layering Problem. - Ulf Rüegg; Thorsten Ehlers; Miro Spönemann; Reinhard von Hanxleden (GD, 2016)

Jdrasil: A Modular Library for Computing Tree Decompositions. - Max Bannach; Sebastian Berndt 001; Thorsten Ehlers (SEA, 2017)

Merging almost sorted sequences yields a 24-sorter. - Thorsten Ehlers (Inf. Process. Lett., 2017)

Generalized Layerings for Arbitrary and Fixed Drawing Areas. - Ulf Rüegg; Thorsten Ehlers; Miro Spönemann; Reinhard von Hanxleden (J. Graph Algorithms Appl., 2017)

SAT and CP - Parallelisation and Applications. - Thorsten Ehlers (2017)

Breaking Symmetries with Lex Implications. - Michael Codish; Thorsten Ehlers; Graeme Gange; Avraham Itzhakov; Peter J. Stuckey (FLOPS, 2018)

Tuning Parallel SAT Solvers. - Thorsten Ehlers; Dirk Nowotka (POS@SAT, 2018)

Estimating Latencies of Task Sequences in Multi-Core Automotive ECUs. - Max J. Friese; Thorsten Ehlers; Dirk Nowotka (SIES, 2018)

Improving Estimations for Latencies of Cause-Effect Chains. - Max J. Friese; Thorsten Ehlers; Dirk Nowotka (IESS, 2019)

On Solving Word Equations Using SAT. - Joel D. Day; Thorsten Ehlers; Mitja Kulczynski; Florin Manea; Dirk Nowotka; Danny Bøgsted Poulsen (RP, 2019)

On Modelling the Avoidability of Patterns as CSP. - Thorsten Ehlers; Florin Manea; Dirk Nowotka; Kamellia Reshadi (CoRR, 2019)

Sorting networks: To the end and back again. - Michael Codish; Luís Cruz-Filipe; Thorsten Ehlers; Mike Müller; Peter Schneider-Kamp (J. Comput. Syst. Sci., 2019)