Thorsten Ehlers
From MaRDI portal
Person:344520
Available identifiers
zbMath Open ehlers.thorstenMaRDI QIDQ344520
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| On solving word equations using SAT | 2019-10-22 | Paper |
| Sorting networks: to the end and back again | 2019-06-25 | Paper |
| Jdrasil: A Modular Library for Computing Tree Decompositions | 2018-08-13 | Paper |
| Breaking symmetries with lex implications | 2018-07-09 | Paper |
| Generalized Layerings for Arbitrary and Fixed Drawing Areas | 2017-10-12 | Paper |
| A Generalization of the Directed Graph Layering Problem | 2017-02-21 | Paper |
| Merging almost sorted sequences yields a 24-sorter | 2016-11-23 | Paper |
| Parallelizing Constraint Programming with Learning | 2016-06-27 | Paper |
| New Bounds on Optimal Sorting Networks | 2015-10-20 | Paper |
| \(k\)-abelian pattern matching | 2015-08-24 | Paper |
| k-Abelian Pattern Matching | 2014-10-14 | Paper |
Research outcomes over time
This page was built for person: Thorsten Ehlers
