Minimean optimal key arrangements in hash tables

DOI10.1007/BF01192048zbMath0830.68069OpenAlexW1974088338MaRDI QIDQ1900894

Andrew Chi-Chih Yao

Publication date: 25 October 1995

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01192048

zbMATH Keywords

hash function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The analysis of double hashing
• On the Expected Value of a Random Assignment Problem
• On optimal arrangements of keys with double hashing
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Optimal Arrangement of Keys in a Hash Table
• Efficient Ordering of Hash Tables
• On Representatives of Subsets
• Reducing the retrieval time of scatter storage techniques

This page was built for publication: Minimean optimal key arrangements in hash tables