97 citations · 392 across the 64 of their papers we have counts for
5 papers · 2 filters
Efficient Random Sampling -- Parallel, Vectorized, Cache-Efficient, and Online
Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider +2
We consider the problem of sampling numbers from the range without replacement on modern architectures. The main result is a simple divide-and-conquer scheme t…
Engineering a Distributed Full-Text Index
Johannes Fischer, Florian Kurpicz, Peter Sanders
We present a distributed full-text index for big data applications in a distributed environment. Our index can answer different types of pattern matching queries (existential, coun…
Scalable Generation of Scale-free Graphs
Peter Sanders, Christian Schulz
We explain how massive instances of scale-free graphs following the Barabasi-Albert model can be generated very quickly in an embarrassingly parallel way. This makes this popular m…
Accelerating Local Search for the Maximum Independent Set Problem
Jakob Dahlum, Sebastian Lamm, Peter Sanders +3
Computing high-quality independent sets quickly is an important problem in combinatorial optimization. Several recent algorithms have shown that kernelization techniques can be use…
Concurrent Hash Tables: Fast and General?(!)
Tobias Maier, Peter Sanders, Roman Dementiev
Concurrent hash tables are one of the most important concurrent data structures with numerous applications. Since hash table accesses can dominate the execution time of the overall…