Thorsten Ehlers

According to our database1, Thorsten Ehlers
  • authored at least 16 papers between 2013 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
SAT and CP - Parallelisation and Applications.
PhD thesis, 2017

Generalized Layerings for Arbitrary and Fixed Drawing Areas.
J. Graph Algorithms Appl., 2017

Merging almost sorted sequences yields a 24-sorter.
Inf. Process. Lett., 2017

Jdrasil: A Modular Library for Computing Tree Decompositions.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016
A Generalization of the Directed Graph Layering Problem.
CoRR, 2016

A Generalization of the Directed Graph Layering Problem.
Proceedings of the Graph Drawing and Network Visualization, 2016

Parallelizing Constraint Programming with Learning.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

2015
k-Abelian pattern matching.
J. Discrete Algorithms, 2015

New Bounds on Optimal Sorting Networks.
CoRR, 2015

Sorting Networks: to the End and Back Again.
CoRR, 2015

New Bounds on Optimal Sorting Networks.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
Faster Sorting Networks for $17$, $19$ and $20$ Inputs.
CoRR, 2014

Formal software verification for the migration of embedded code from single- to multicore systems.
Proceedings of the Software Engineering 2014, Fachtagung des GI-Fachbereichs Softwaretechnik, 25. Februar, 2014

Communication in Massively-Parallel SAT Solving.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

k-Abelian Pattern Matching.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
Online-Scheduling on Identical Machines with Bounded Migration.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013


  Loading...