97 citations · 392 across the 64 of their papers we have counts for
6 papers · 2 filters
Concurrent Expandable AMQs on the Basis of Quotient Filters
Tobias Maier, Peter Sanders, Robert Williger
A quotient filter is a cache efficient AMQ data structure. Depending on the fill degree of the filter most insertions and queries only need to access one or two consecutive cache l…
Communication-Efficient (Weighted) Reservoir Sampling from Fully Distributed Data Streams
Lorenz Hübschle-Schneider, Peter Sanders
We consider communication-efficient weighted and unweighted (uniform) random sampling from distributed data streams presented as a sequence of mini-batches of items. This is a natu…
More Hierarchy in Route Planning Using Edge Hierarchies
Demian Hespe, Peter Sanders
A highly successful approach to route planning in networks (particularly road networks) is to identify a hierarchy in the network that allows faster queries after some preprocessin…
Linear Work Generation of R-MAT Graphs
Lorenz Hübschle-Schneider, Peter Sanders
R-MAT is a simple, widely used recursive model for generating `complex network' graphs with a power law degree distribution and community structure. We make R-MAT even more useful…
Parallel Weighted Random Sampling
Lorenz Hübschle-Schneider, Peter Sanders
Data structures for efficient sampling from a set of weighted items are an important building block of many applications. However, few parallel solutions are known. We close many o…
Load-Balancing for Parallel Delaunay Triangulations
Daniel Funke, Peter Sanders, Vincent Winkler
Computing the Delaunay triangulation (DT) of a given point set in is one of the fundamental operations in computational geometry. Recently, Funke and Sanders (2017)…