25 citations · 38 across the 5 of their papers we have counts for
5 papers · 1 filter
Scalable Distributed-Memory External Sorting
Mirko Rahn, Peter Sanders, Johannes Singler
We engineer algorithms for sorting huge data sets on massively parallel machines. The algorithms are based on the multiway merging paradigm. We first outline an algorithm whose I/O…
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…
Fast Detour Computation for Ride Sharing
Robert Geisberger, Dennis Luxen, Sabine Neubauer +2
Todays ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So find…
Towards Optimal Range Medians
Beat Gfeller, Peter Sanders
We consider the following problem: given an unsorted array of elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the int…
Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
Peter Sanders
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks with…