Hans-Peter Lehmann

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

Collaborative distances:

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

2023

Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing.

Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

CoRR, 2023

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

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 Symposium on Algorithm Engineering and Experiments, 2023

PaCHash: Packed and Compressed Hash Tables.

Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2021

Weighted Random Sampling on GPUs.

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

CoRR, 2021