Michael Axtmann

According to our database, Michael Axtmann authored at least 9 papers between 2014 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Engineering In-place (Shared-memory) Sorting Algorithms.

Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders

ACM Trans. Parallel Comput., 2022

2021

Robust Scalable Sorting.

Michael Axtmann

PhD thesis, 2021

2018

Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort.

Michael Axtmann, Armin Wiebigke, Peter Sanders

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2017

Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort.

Michael Axtmann, Armin Wiebigke, Peter Sanders

CoRR, 2017

In-Place Parallel Super Scalar Samplesort (IPSSSSo).

Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Robust Massively Parallel Sorting.

Michael Axtmann, Peter Sanders

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016

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

Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

2015

Practical Massively Parallel Sorting.

Michael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014

Practical Massively Parallel Sorting - Basic Algorithmic Ideas.

Michael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz

CoRR, 2014