3 citations · 3 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014
Practical Massively Parallel Sorting
Michael Axtmann, Timo Bingmann, Peter Sanders +1
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive communication volume or prohibitive critical path length. We…
cs.DS2014★ 3 cited
(Semi-)External Algorithms for Graph Partitioning and Clustering
Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are key tools for processin…