97 citations · 392 across the 64 of their papers we have counts for
8 papers · 1 filter
Faster Exact Search using Document Clustering
Jonathan Dimond, Peter Sanders
We show how full-text search based on inverted indices can be accelerated by clustering the documents without losing results (SeCluD -- SEarch with CLUstered Documents). We develop…
MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues
Hamza Rihani, Peter Sanders, Roman Dementiev
Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branch-and-bound. However,…
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…
PReaCH: A Fast Lightweight Reachability Index using Pruning and Contraction Hierarchies
Florian Merz, Peter Sanders
We develop the data structure PReaCH (for Pruned Reachability Contraction Hierarchies) which supports reachability queries in a directed graph, i.e., it supports queries that ask w…
(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…
Parallel Graph Partitioning for Complex Networks
Henning Meyerhenke, Peter Sanders, Christian Schulz
Processing large complex networks like social networks or web graphs has recently attracted considerable interest. In order to do this in parallel, we need to partition them into p…