Dr. rer. nat. Hans-Peter Lehmann
- Room: 220
- Phone: +49 721 608-46781
- Fax: 49 721 608-43088
- hans-peter lehmann ∂does-not-exist.kit edu
- github.com/ByteHamster
Research Interests
I'm working on compact data structures, in particular different variants of perfect hashing. A perfect hash function is a function h: S → [m] which has no collisions on a given input set S. On all other inputs, the function is undefined. So in particular, it might have collisions. Furthermore, I am interested in index data structures in general, as well as accelerating algorithms using GPUs.
| Bild | Title | Short Description | Source Code | Corresponding Paper |
|---|---|---|---|---|
| Consensus-RecSplit | Perfect hashing by Combined Search and Encoding of Successful Seeds |
|||
| SicHash | A Perfect Hash Function based on irregular cuckoo hashing |
|||
| PaCHash | External perfect hash table for objects of variable size |
|||
| GPURecSplit / SIMDRecSplit | Parallelization of a space-efficient minimal perfect hash function |
|||
| LeMonHash | Monotone Minimal Perfect Hashing based on Retrieval and the PGM-Index |
|||
| ShockHash | Space-efficient perfect hash function based on finding random pseudoforests |
| Title | Authors | Source | Date |
|---|---|---|---|
| Engineering Minimal k-Perfect Hash Functions | Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
April 2025 | |
| Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing | Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
February 2025 | |
| Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval | Matthias Becht, Hans-Peter Lehmann, Peter Sanders |
November 2024 | |
| PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding | Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer |
April 2024 | |
| Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing | Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
October 2023 | |
| ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force | Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
August 2023 | |
| Learned Monotone Minimal Perfect Hashing | Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra |
April 2023 | |
| High Performance Construction of RecSplit Based Minimal Perfect Hash Functions | Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders |
December 2022 | |
| SicHash - Small Irregular Cuckoo Tables for Perfect Hashing | Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
October 2022 | |
| PaCHash: Packed and Compressed Hash Tables | Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders |
May 2022 | |
| Weighted Random Sampling on GPUs | Hans-Peter Lehmann, Lorenz Hübschle-Schneider, and Peter Sanders |
June 2021 |
| Title | Conference | Author(s) |
|---|---|---|
| ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force | Symposium on Algorithm Engineering and Experiments (ALENEX'24) |
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
| SicHash – Small Irregular Cuckoo Tables for Perfect Hashing | Symposium on Algorithm Engineering and Experiments (ALENEX'23) |
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
| High Performance Construction of RecSplit Based Minimal Perfect Hash Functions | European Symposium on Algorithms (ESA'23) |
Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders |
| Fast and Space-Efficient Perfect Hashing | Doctoral Defense |
Hans-Peter Lehmann |
| Title | Type | Semester |
|---|---|---|
| Algorithmen I | Vorlesung / Übung (VÜ) | SS 2025 |
| Parallele Algorithmen | Vorlesung (V) | WS 24/25 |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2024 |
| Randomisierte Algorithmik | Vorlesung / Übung (VÜ) | WS 23/24 |
| Karopapier-Rennen | Praxis der Softwareentwicklung | WS 23/24 |
| Seminar: Proofs from THE BOOK | Seminar | Summer term 2023 |
| Algorithms II | Lecture | Winter term 22/23 |
| Podcast-Synchronisations-Server | Praxis der Softwareentwicklung | WS 22/23 |
| Cloud Service für NP-schwere Probleme | Praxis der Softwareentwicklung | SS 2022 |
| Algorithmen II | Vorlesung (V) | WS 21/22 |
| Algorithm Engineering | Vorlesung (V) | SS 2021 |
| Title | Subject | Supervisor | Student |
|---|---|---|---|
| Wavelet Tree Construction on the GPU | Succinct Data Structures | Nikola Boban |
|
| Engineering k-perfect hashing | Perfect Hashing | Sebastian Kirmayer |
|
| Compacting Minimal Perfect Hashing using Symbiotic Random Search | Perfect Hashing | Jonatan Pascal Ziegler |
|
| Cuckoo-PTHash: Exploring Cuckoo Hashing in the PTHash Framework | Perfect Hashing | Benedikt Waibel |
|
| Accelerating Minimal Perfect Hash Function Construction using GPU Parallelization | Perfect Hashing | Stefan Hermann |
|
| Engineering Succinct Predecessor Data Structures | Succinct Data Structures | Jan Benedikt Schwarz |
|
| Compressed Bit Vectors with Rank and Select Support | Succinct Data Structures | Tobias Paweletz |
|
| Perfect Hash Function Generation on the GPU | Perfect Hashing | Dominik Bez |