The following pages link to Thorsten Ehlers (Q344520):
Displaying 11 items.
- Merging almost sorted sequences yields a 24-sorter (Q344521) (← links)
- \(k\)-abelian pattern matching (Q491150) (← links)
- Breaking symmetries with lex implications (Q1648885) (← links)
- On solving word equations using SAT (Q2330594) (← links)
- Sorting networks: to the end and back again (Q2424684) (← links)
- Parallelizing Constraint Programming with Learning (Q2815101) (← links)
- k-Abelian Pattern Matching (Q2921982) (← links)
- A Generalization of the Directed Graph Layering Problem (Q2961516) (← links)
- New Bounds on Optimal Sorting Networks (Q3195693) (← links)
- Jdrasil: A Modular Library for Computing Tree Decompositions (Q4580187) (← links)
- Generalized Layerings for Arbitrary and Fixed Drawing Areas (Q5367025) (← links)
