7 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.DS2013
Efficient Parallel and External Matching
Marcel Birn, Vitaly Osipov, Peter Sanders +2
We show that a simple algorithm for computing a matching on a graph runs in a logarithmic number of phases incurring work linear in the input size. The algorithm can be adapted to…
cs.DS2010★ 7 cited
n-Level Graph Partitioning
Vitaly Osipov, Peter Sanders
We present a multi-level graph partitioning algorithm based on the extreme idea to contract only a single edge on each level of the hierarchy. This obviates the need for a matching…
cs.DS2009
GPU sample sort
Nikolaj Leischner, Vitaly Osipov, Peter Sanders
In this paper, we present the design of a sample sort algorithm for manycore GPUs. Despite being one of the most efficient comparison-based sorting algorithms for distributed memor…