22 citations · 34 across the 7 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 22 cited
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…
cs.DS2016★ 2 cited
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…