1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2024★ 1 cited
Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval
Matthias Becht, Hans-Peter Lehmann, Peter Sanders
A retrieval data structure stores a static function f : S -> {0,1}^r . For all x in S, it returns the r-bit value f(x), while for other inputs it may return an arbitrary result. Th…
cs.DS2023
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…
cs.DS2023
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…