1 paper · 1 filter
Michael Axtmann, Sascha Witt, Daniel Ferizovic +1
We present a sorting algorithm that works in-place, executes in parallel, is cache-efficient, avoids branch-mispredictions, and performs work O(n log n) for arbitrary inputs with h…