Binary linear hashing matches fully independent hashing in the leading term and dominant second-order correction of expected maximum load up to a 1+o(1) factor.
Is linear hashing good? InProceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 465–474
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Note on Second-Order Expected Maximum-Load Bounds for Binary Linear Hashing
Binary linear hashing matches fully independent hashing in the leading term and dominant second-order correction of expected maximum load up to a 1+o(1) factor.