サインイン
インサイト - Minimal Perfect Hashing
Analysis of Simplified Tight Bounds for Monotone Minimal Perfect Hashing
The author presents a simplified proof of tight lower bounds for Monotone Minimal Perfect Hashing, focusing on the structure and analysis of random sequences on large universes.
Efficient Construction of Minimal Perfect Hash Functions with Optimized Bucket Sizes and Interleaved Coding
This paper introduces PHOBIC, a technique for constructing minimal perfect hash functions that optimizes bucket sizes and uses an interleaved coding scheme to improve space efficiency and construction speed compared to prior approaches.
