Minimean optimal key arrangements in hash tables

DOI10.1007/BF01192048zbMATH Open0830.68069OpenAlexW1974088338MaRDI QIDQ1900894FDOQ1900894

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

Recommendations

• On optimal arrangements of keys with double hashing
• The analysis of double hashing
• Asymptotic distribution for the cost of linear probing hashing
• Algorithmic aspects in speech recognition
• Optimal hashing

zbMATH Keywords

hash function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• On Representatives of Subsets
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Efficient Ordering of Hash Tables
• Reducing the retrieval time of scatter storage techniques
• Title not available (Why is that?)
• On the Expected Value of a Random Assignment Problem
• Optimal Arrangement of Keys in a Hash Table
• The analysis of double hashing
• Title not available (Why is that?)
• On optimal arrangements of keys with double hashing

Cited In (2)

• Hash table reorganization
• On optimal arrangements of keys with double hashing

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

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