Fast Entity Resolution With Mock Labels and Sorted Integer Sets. - Mark Blacher; Joachim Giesen; Sören Laue; Julien Klaus; Matthias Mitterreiter (DI2KG@VLDB, 2020)

Fast and Robust Vectorized In-Place Sorting of Primitive Types. - Mark Blacher; Joachim Giesen; Lars Kuehne (SEA, 2021)

Optimization for Classical Machine Learning Problems on the GPU. - Sören Laue; Mark Blacher; Joachim Giesen (AAAI, 2022)

Machine Learning, Linear Algebra, and More: Is SQL All You Need? - Mark Blacher; Joachim Giesen; Sören Laue; Julien Klaus; Viktor Leis (CIDR, 2022)

Compiling Linear Algebra Expressions into Efficient Code. - Julien Klaus; Mark Blacher; Joachim Giesen; Paul Gerhardt Rump; Konstantin Wiedom (ICCS (1), 2022)

Vectorized and performance-portable quicksort. - Jan Wassenberg; Mark Blacher; Joachim Giesen; Peter Sanders 001 (Softw. Pract. Exp., 2022)

Compiling Tensor Expressions into Einsum. - Julien Klaus; Mark Blacher; Joachim Giesen (ICCS (2), 2023)

Efficient and Portable Einstein Summation in SQL. - Mark Blacher; Julien Klaus; Christoph Staudt; Sören Laue; Viktor Leis; Joachim Giesen (Proc. ACM Manag. Data, 2023)

A visual analytics workflow for probabilistic modeling. - Julien Klaus; Mark Blacher; Andreas Goral; Philipp Lucas 002; Joachim Giesen (Vis. Informatics, 2023)

Model Counting and Sampling via Semiring Extensions. - Andreas Goral; Joachim Giesen; Mark Blacher; Christoph Staudt; Julien Klaus (AAAI, 2024)

Einsum Benchmark: Enabling the Development of Next-Generation Tensor Execution Engines. - Mark Blacher; Christoph Staudt; Julien Klaus; Maurice Wenig; Niklas Merk; Alexander Breuer; Max Engel; Sören Laue; Joachim Giesen (NeurIPS, 2024)

Serving MPE Queries on Tensor Networks by Computing Derivatives. - Maurice Wenig; Hanno Barschel; Joachim Giesen; Andreas Goral; Mark Blacher (PGM, 2024)

Improved Cut Strategy for Tensor Network Contraction Orders. - Christoph Staudt; Mark Blacher; Julien Klaus; Farin Lippmann; Joachim Giesen (SEA, 2024)

Optimizing Tensor Contraction Paths: A Greedy Algorithm Approach With Improved Cost Functions. - Sheela Orgler; Mark Blacher (CoRR, 2024)

Einsum Trees: An Abstraction for Optimizing the Execution of Tensor Expressions. - Alexander Breuer; Mark Blacher; Max Engel; Joachim Giesen; Alexander Heinecke; Julien Klaus; Stefan Remke (ASPLOS (2), 2025)