On optimal arrangements of keys with double hashing

DOI10.1016/0196-6774(85)90042-2MaRDI QIDQ3723740zbMATH OpenOpenAlexFDO

Authors Andrew Chi-Chih Yao

Publication date 1985

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(85)90042-2

zbMATH Keywords

worst-case retrieval time

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Recommendations

• Minimean optimal key arrangements in hash tables
• The analysis of double hashing
• More analysis of double hashing
• Double hashing with passbits
• Dynamic Perfect Hashing: Upper and Lower Bounds

Cited in

(2)

• Double hashing with passbits
• Minimean optimal key arrangements in hash tables

This page was built for publication: On optimal arrangements of keys with double hashing

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