New sampling-based constructions achieve better space upper bounds for α-perfect hashing than a baseline randomizing between perfect and zero-bit hashing, for all α in [0,1].
Fredman–Komlós bounds and information theory
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Space Upper Bounds for $\alpha$-Perfect Hashing
New sampling-based constructions achieve better space upper bounds for α-perfect hashing than a baseline randomizing between perfect and zero-bit hashing, for all α in [0,1].