Hans-Peter Lehmann

Thomas Mueller

Rasmus Pagh

Giulio Ermanno Pibiri

Sebastiano Vigna

CoRR, June, 2025

Engineering Minimal k-Perfect Hash Functions.

[BibT_eX]

[DOI]

CoRR, April, 2025

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

[BibT_eX]

[DOI]

CoRR, February, 2025

2024

Fast and Space-Efficient Perfect Hashing.

[BibT_eX]

[DOI]

PhD thesis, 2024

Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval.

[BibT_eX]

[DOI]

Matthias Becht

CoRR, 2024

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

[BibT_eX]

[DOI]

Stefan Hermann

Giulio Ermanno Pibiri

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

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

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

2023

Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing.

[BibT_eX]

[DOI]

CoRR, 2023

Sliding Block Hashing (Slick) - Basic Algorithmic Ideas.

[BibT_eX]

[DOI]

CoRR, 2023

Learned Monotone Minimal Perfect Hashing.

[BibT_eX]

[DOI]

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

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions.

[BibT_eX]

[DOI]

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

SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

PaCHash: Packed and Compressed Hash Tables.

[BibT_eX]

[DOI]

Florian Kurpicz

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2021

Weighted Random Sampling on GPUs.

[BibT_eX]

[DOI]

Lorenz Hübschle-Schneider