Tabulation based 5-universal hashing and linear probing

DOI10.1137/1.9781611972900.7MaRDI QIDQ5233597zbMATH OpenOpenAlexFDO

Authors Mikkel Thorup, Yin Zhang

Publication date 11 September 2019

Published in 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.2663

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
• Linear probing with 5-wise independence
• Linear probing with constant independence
• String hashing for linear probing
• Publication:4952657

Cited in

(7)

• Linear probing with 5-wise independence
• Linear probing with constant independence
• String hashing for linear probing
• scientific article; zbMATH DE number 1445340 (Why is no real title available?)
• Tabulation based 4-universal hashing with applications to second moment estimation
• T5: Hashing five inputs with three compression calls
• Universal Hash Families

This page was built for publication: Tabulation based 5-universal hashing and linear probing

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