Twisted tabulation hashing

DOI10.1137/1.9781611973105.16MaRDI QIDQ5741724zbMATH OpenOpenAlexFDO

Authors Mihai Patrascu, Mikkel Thorup

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973105.16

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
• Approximately minwise independence with twisted tabulation
• Independence of tabulation-based hash classes

Cited in

(6)

• Independence of tabulation-based hash classes
• Hopscotch Hashing
• Non-empty bins with simple tabulation hashing
• Tabulation based 4-universal hashing with applications to second moment estimation
• Unlocking the lookup singularity with \textsf{Lasso}
• SNARK lower bounds via communication complexity

This page was built for publication: Twisted tabulation hashing

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