Nonoblivious hashing

DOI10.1145/146585.146591MaRDI QIDQ4302788zbMATH OpenOpenAlexFDO

Authors Moni Naor, Jeanette P. Schmidt, Amos Fiat, Alan Siegel

Publication date 21 August 1994

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

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

zbMATH Keywords

multikey recordsnonoblivious hashing

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• The Spatial Complexity of Oblivious k-Probe Hash Functions
• scientific article; zbMATH DE number 1875412
• Cuckoo hashing
• Hashing with Linear Probing under Nonuniform Probabilities
• Quasi-perfect Hashing

Cited in

(8)

• Non-expansive hashing
• Storing information with extractors.
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
• Expedient Non-malleability Notions for Hash Functions
• The Spatial Complexity of Oblivious k-Probe Hash Functions
• scientific article; zbMATH DE number 1256770 (Why is no real title available?)
• Tables should be sorted (on random access machines)
• Nearly Optimal Static Las Vegas Succinct Dictionary

This page was built for publication: Nonoblivious hashing

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