97 citations · 392 across the 64 of their papers we have counts for
64 papers · 1 filter
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…
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions
Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann +1
A minimal perfect hash function (MPHF) bijectively maps a set S of objects to the first |S| integers. It can be used as a building block in databases and data compression. RecSplit…
SicHash -- Small Irregular Cuckoo Tables for Perfect Hashing
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
A Perfect Hash Function (PHF) is a hash function that has no collisions on a given input set. PHFs can be used for space efficient storage of data in an array, or for determining a…