Weighted Random Sampling on GPUs. - Hans-Peter Lehmann; Lorenz Hübschle-Schneider; Peter Sanders 001 (CoRR, 2021)

PaCHash: Packed and Compressed Hash Tables. - Florian Kurpicz; Hans-Peter Lehmann; Peter Sanders 001 (ALENEX, 2023)

SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (ALENEX, 2023)

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. - Dominik Bez; Florian Kurpicz; Hans-Peter Lehmann; Peter Sanders 001 (ESA, 2023)

Learned Monotone Minimal Perfect Hashing. - Paolo Ferragina; Hans-Peter Lehmann; Peter Sanders 001; Giorgio Vinciguerra (ESA, 2023)

Sliding Block Hashing (Slick) - Basic Algorithmic Ideas. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (CoRR, 2023)

Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (CoRR, 2023)

ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (ALENEX, 2024)

PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. - Stefan Hermann; Hans-Peter Lehmann; Giulio Ermanno Pibiri; Peter Sanders 001; Stefan Walzer (ESA, 2024)

Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval. - Matthias Becht; Hans-Peter Lehmann; Peter Sanders 001 (CoRR, 2024)

Fast and Space-Efficient Perfect Hashing. - Hans-Peter Lehmann (2024)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing. - Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer; Jonatan Ziegler (CoRR, 2025)

Engineering Minimal k-Perfect Hash Functions. - Stefan Hermann; Sebastian Kirmayer; Hans-Peter Lehmann; Peter Sanders 001; Stefan Walzer (CoRR, 2025)

Modern Minimal Perfect Hashing: A Survey. - Hans-Peter Lehmann; Thomas Mueller; Rasmus Pagh; Giulio Ermanno Pibiri; Peter Sanders 001; Sebastiano Vigna; Stefan Walzer (CoRR, 2025)