Hans-Peter Lehmann

According to our database, Hans-Peter Lehmann authored at least 21 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Modern Minimal Perfect Hashing: A Survey.

Hans-Peter Lehmann, Thomas Mueller Graf, Rasmus Pagh, Giulio Ermanno Pibiri, Peter Sanders, Sebastiano Vigna, Stefan Walzer

ACM Comput. Surv., July, 2026

Learned Static Function Data Structures.

Stefan Hermann, Hans-Peter Lehmann, Giorgio Vinciguerra, Stefan Walzer

Proc. VLDB Endow., January, 2026

2025

ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force.

Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

Algorithmica, November, 2025

Engineering Minimal k-Perfect Hash Functions.

Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

Dataset, November, 2025

ByteHamster/ConsensusRecSplit.

Hans-Peter Lehmann, Peter Sanders, Stefan Walzer, Jonatan Ziegler

Dataset, October, 2025

ByteHamster/MPHF-Experiments.

Hans-Peter Lehmann

Dataset, October, 2025

Engineering Minimal k-Perfect Hash Functions.

Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Stefan Walzer

Dataset, October, 2025

Modern Minimal Perfect Hashing: A Survey.

Hans-Peter Lehmann, Thomas Mueller, Rasmus Pagh, Giulio Ermanno Pibiri, Peter Sanders, Sebastiano Vigna, Stefan Walzer

CoRR, June, 2025

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing.

Hans-Peter Lehmann, Peter Sanders, Stefan Walzer, Jonatan Ziegler

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Engineering Minimal k-Perfect Hash Functions.

Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Fast and Space-Efficient Perfect Hashing.

Hans-Peter Lehmann

PhD thesis, 2024

Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval.

Matthias Becht, Hans-Peter Lehmann, Peter Sanders

CoRR, 2024

PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding.

Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force.

Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

Proceedings of the 26th Symposium on Algorithm Engineering and Experiments, 2024

2023

Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing.

Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

CoRR, 2023

Sliding Block Hashing (Slick) - Basic Algorithmic Ideas.

Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

CoRR, 2023

Learned Monotone Minimal Perfect Hashing.

Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions.

Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.

Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

Proceedings of the 25th Symposium on Algorithm Engineering and Experiments, 2023

PaCHash: Packed and Compressed Hash Tables.

Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders

Proceedings of the 25th Symposium on Algorithm Engineering and Experiments, 2023

2021

Weighted Random Sampling on GPUs.

Hans-Peter Lehmann, Lorenz Hübschle-Schneider, Peter Sanders

CoRR, 2021