Linear hash functions

DOI10.1145/324133.324179MaRDI QIDQ3158554zbMATHOpenAlexFDO

Authors Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos

Publication date 25 January 2005

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/324133.324179

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• On linear hash codes
• Compositions of linear functions and applications to hashing
• scientific article; zbMATH DE number 1156718
• On linear hashing of binary sets
• A new multi-linear universal hash family
• Linear hashing is awesome
• Programmable hash functions in the multilinear setting
• Implicit data structures for linear hashing schemes
• A unified approach to linear probing hashing

Cited in

(7)

• HalftimeHash: modern hashing without 64-bit multipliers or finite fields
• scientific article; zbMATH DE number 1559562 (Why is no real title available?)
• Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
• Linear hashing is awesome
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• Hashing via finite field
• Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds

This page was built for publication: Linear hash functions

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