Nonoblivious hashing

DOI10.1145/146585.146591zbMath0799.68057OpenAlexW2295319256MaRDI QIDQ4302788

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

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

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

Related Items (5)

Tables should be sorted (on random access machines) ⋮ Nearly Optimal Static Las Vegas Succinct Dictionary ⋮ Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions ⋮ Pseudo-random graphs and bit probe schemes with one-sided error ⋮ Storing information with extractors.

This page was built for publication: Nonoblivious hashing