Practical Massively Parallel Sorting - Basic Algorithmic Ideas. - Michael Axtmann; Timo Bingmann; Peter Sanders 001; Christian Schulz 003 (CoRR, 2014)

Practical Massively Parallel Sorting. - Michael Axtmann; Timo Bingmann; Peter Sanders 001; Christian Schulz 003 (SPAA, 2015)

Thrill: High-performance algorithmic distributed batch data processing with C++. - Timo Bingmann; Michael Axtmann; Emanuel Jöbstl; Sebastian Lamm; Huyen Chau Nguyen; Alexander Noe; Sebastian Schlag; Matthias Stumpp; Tobias Sturm; Peter Sanders 001 (IEEE BigData, 2016)

Robust Massively Parallel Sorting. - Michael Axtmann; Peter Sanders 001 (ALENEX, 2017)

In-Place Parallel Super Scalar Samplesort (IPSSSSo). - Michael Axtmann; Sascha Witt; Daniel Ferizovic; Peter Sanders 001 (ESA, 2017)

Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort. - Michael Axtmann; Armin Wiebigke; Peter Sanders 001 (CoRR, 2017)

Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort. - Michael Axtmann; Armin Wiebigke; Peter Sanders 001 (IPDPS, 2018)

Robust Scalable Sorting. - Michael Axtmann (2021)

Engineering In-place (Shared-memory) Sorting Algorithms. - Michael Axtmann; Sascha Witt; Daniel Ferizovic; Peter Sanders 001 (ACM Trans. Parallel Comput., 2022)