97 citations · 392 across the 64 of their papers we have counts for
95 papers
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
Marvin Williams, Peter Sanders
Priority queues are used in a wide range of applications, including prioritized online scheduling, discrete event simulation, and greedy algorithms. In parallel settings, classical…
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
A minimal perfect hash function (MPHF) maps a set of keys to the first integers without collisions. There is a lower bound of bits of space needed…
Fast Many-to-Many Routing for Ridesharing with Multiple Pickup and Dropoff Locations
Moritz Laupichler, Peter Sanders
We introduce KaRRi, an improved algorithm for scheduling a fleet of shared vehicles as it is used by services like UberXShare and Lyft Shared. We speed up the basic online algorith…
Sliding Block Hashing (Slick) -- Basic Algorithmic Ideas
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
We present {\bf Sli}ding Blo{\bf ck} Hashing (Slick), a simple hash table data structure that combines high performance with very good space efficiency. This preliminary report out…
Scalable High-Quality Hypergraph Partitioning
Lars Gottesbüren, Tobias Heuer, Nikolai Maas +2
Balanced hypergraph partitioning is an NP-hard problem with many applications, e.g., optimizing communication in distributed data placement problems. The goal is to place all nodes…
Efficient Yao Graph Construction
Daniel Funke, Peter Sanders
Yao graphs are geometric spanners that connect each point of a given point set to its nearest neighbor in each of cones drawn around it. Yao graphs were introduced to construct…