Thorsten Ehlers

25 papers A 1B 3C 3Misc 2Journal 11Unranked 4
YearRankTypeTitle / Venue / Authors
2019 — conf
Improving Estimations for Latencies of Cause-Effect Chains.
IESS
Max J. Friese, Thorsten Ehlers, Dirk Nowotka
2019 J jnl
On Modelling the Avoidability of Patterns as CSP.
CoRR
Thorsten Ehlers, Florin Manea, Dirk Nowotka, Kamellia Reshadi
2019 — conf
On Solving Word Equations Using SAT.
RP
Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen
2019 J jnl
On Solving Word Equations Using SAT.
CoRR
Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen
2019 J jnl
Sorting networks: To the end and back again.
J. Comput. Syst. Sci.
Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp
2018 Misc conf
Breaking Symmetries with Lex Implications.
FLOPS
Michael Codish, Thorsten Ehlers, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey
2018 — conf
Estimating Latencies of Task Sequences in Multi-Core Automotive ECUs.
SIES
Max J. Friese, Thorsten Ehlers, Dirk Nowotka
2018 J jnl
Estimating Latencies of Task Sequences in Multi-Core Automotive ECUs.
CoRR
Max J. Friese, Thorsten Ehlers, Dirk Nowotka
2018 — conf
Tuning Parallel SAT Solvers.
POS@SAT
Thorsten Ehlers, Dirk Nowotka
2017 J jnl
Generalized Layerings for Arbitrary and Fixed Drawing Areas.
J. Graph Algorithms Appl.
Ulf Rüegg, Thorsten Ehlers, Miro Spönemann, Reinhard von Hanxleden
2017 B conf
Jdrasil: A Modular Library for Computing Tree Decompositions.
SEA
Max Bannach, Sebastian Berndt, Thorsten Ehlers
2017 J jnl
Merging almost sorted sequences yields a 24-sorter.
Inf. Process. Lett.
Thorsten Ehlers
2017 — —
SAT and CP - Parallelisation and Applications.
Thorsten Ehlers
2016 A conf
A Generalization of the Directed Graph Layering Problem.
GD
Ulf Rüegg, Thorsten Ehlers, Miro Spönemann, Reinhard von Hanxleden
2016 J jnl
A Generalization of the Directed Graph Layering Problem.
CoRR
Ulf Rüegg, Thorsten Ehlers, Miro Spönemann, Reinhard von Hanxleden
2016 B conf
Parallelizing Constraint Programming with Learning.
CPAIOR
Thorsten Ehlers, Peter J. Stuckey
2015 C conf
New Bounds on Optimal Sorting Networks.
CiE
Thorsten Ehlers, Mike Müller
2015 J jnl
New Bounds on Optimal Sorting Networks.
CoRR
Thorsten Ehlers, Mike Müller
2015 J jnl
Sorting Networks: to the End and Back Again.
CoRR
Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp
2015 J jnl
k-Abelian pattern matching.
J. Discrete Algorithms
Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka
2014 B conf
Communication in Massively-Parallel SAT Solving.
ICTAI
Thorsten Ehlers, Dirk Nowotka, Philipp Sieweck
2014 J jnl
Faster Sorting Networks for $17$, $19$ and $20$ Inputs.
CoRR
Thorsten Ehlers, Mike Müller
2014 C conf
Formal software verification for the migration of embedded code from single- to multicore systems.
Software Engineering
Thorsten Ehlers, Dirk Nowotka, Philipp Sieweck, Johannes Traub
2014 C conf
k-Abelian Pattern Matching.
Developments in Language Theory
Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka
2013 Misc conf
Online-Scheduling on Identical Machines with Bounded Migration.
SYNASC
Thorsten Ehlers, Klaus Jansen