Optimal hashing

DOI10.1016/S0019-9958(84)80010-8MaRDI QIDQ3718156zbMATH OpenOpenAlexFDO

Authors Rafail E. Krichevsky

Publication date 1984

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(84)80010-8

zbMATH Keywords

complexity of hashinglower bounds

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Collections of Functions for Perfect Hashing
• scientific article; zbMATH DE number 3930363
• Uniform Hashing in Constant Time and Optimal Space
• scientific article; zbMATH DE number 1418345
• scientific article; zbMATH DE number 2185600

Cited in

(17)

• Optimality in external memory hashing
• Information compression and Varshamov-Gilbert bound
• Construction of universal enumerators and formulas for threshold functions
• A note on hashing functions and tabu search algorithms
• On linear hashing of binary sets
• Minimean optimal key arrangements in hash tables
• New hash function construction for textual and geometric data retrieval
• Concatenated hash code selection
• scientific article; zbMATH DE number 3930363 (Why is no real title available?)
• scientific article; zbMATH DE number 4104389 (Why is no real title available?)
• Optimal Partial-Match Hashing Design
• Last-come-first-served hashing
• Quasi-perfect Hashing
• scientific article; zbMATH DE number 2112400 (Why is no real title available?)
• Strongly Constrained Discrete Hashing
• Algorithmic aspects in speech recognition
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: Optimal hashing

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