Folgen
Hans-Peter Lehmann
Hans-Peter Lehmann
Karlsruhe Institute of Technology (KIT)
Bestätigte E-Mail-Adresse bei kit.edu
Titel
Zitiert von
Zitiert von
Jahr
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing
HP Lehmann, P Sanders, S Walzer
2023 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2023
7*2023
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions
D Bez, F Kurpicz, HP Lehmann, P Sanders
arXiv preprint arXiv:2212.09562, 2022
72022
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
HP Lehmann, P Sanders, S Walzer
2024 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2024
42024
PaCHash: Packed and Compressed Hash Tables
F Kurpicz, HP Lehmann, P Sanders
2023 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2023
42023
Learned Monotone Minimal Perfect Hashing
P Ferragina, HP Lehmann, P Sanders, G Vinciguerra
arXiv preprint arXiv:2304.11012, 2023
32023
Weighted Random Sampling - Alias Tables on the GPU
HP Lehmann
32020
Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing
HP Lehmann, P Sanders, S Walzer
arXiv preprint arXiv:2310.14959, 2023
12023
Weighted Random Sampling on GPUs
HP Lehmann, L Hübschle-Schneider, P Sanders
arXiv preprint arXiv:2106.12270, 2021
12021
PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
S Hermann, HP Lehmann, GE Pibiri, P Sanders, S Walzer
arXiv preprint arXiv:2404.18497, 2024
2024
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–9