String hashing for linear probing

MaRDI QIDQ4633877zbMATH OpenFDO

Authors Mikkel Thorup

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496842

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Recommendations

• Linear probing with 5-wise independence
• Tabulation based 5-universal hashing and linear probing
• Linear probing with constant independence
• Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
• Hashing with Linear Probing under Nonuniform Probabilities

Cited in

(3)

• The universality of iterated hashing over variable-length strings
• Tabulation based 5-universal hashing and linear probing
• HalftimeHash: modern hashing without 64-bit multipliers or finite fields

This page was built for publication: String hashing for linear probing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633877)