Piotr Beling, Peter Sanders
2026 Proceedings of the SIAM Symposium on Algorithm Engineering and Experiments (ALENEX), pages 1-14, January 2026, doi: 10.1137/1.9781611978957.1
The paper introduces PHast, (minimal) perfect hash function that combines the fastest available queries, very fast construction (especially PHast+ variant), and good space consumption (below 2 bits per key).
Piotr Beling
SoftwareX, volume 26, pages 101681, March 2024, doi: https://doi.org/10.1016/j.softx.2024.101681
The paper presents BSuccinct, a collection of software focused on compact and succinct data structures that are both space and time efficient.
Piotr Beling
ACM Journal of Experimental Algorithmics, May 2023, doi: 10.1145/3596453
In the paper we study a fingerprint-based minimal perfect hash function (FMPH for short). We propose an effective method (called FMPHGO) that reduces the size of FMPH, as well as a number of implementation improvements.
Polish translation of the book The Rust Programming Language.
Succinct data structures and other libraries for Rust.