Minimean optimal key arrangements in hash tables
type: Item
instance of: scholarly article
title: Minimean optimal key arrangements in hash tables
zbMATH Open document ID: 0830.68069
DOI: 10.1007/BF01192048
published in: Algorithmica
publication date: 1995-10-25T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 809152
zbMATH Keywords: hash function
author: Andrew Chi-Chih Yao
MaRDI profile type: Publication
cites work: Reducing the retrieval time of scatter storage techniques
cites work: Q3048278
cites work: Efficient Ordering of Hash Tables
cites work: The analysis of double hashing
cites work: On Representatives of Subsets
cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
cites work: Q3780760
cites work: Q5585020
cites work: Optimal Arrangement of Keys in a Hash Table
cites work: On the Expected Value of a Random Assignment Problem
cites work: On optimal arrangements of keys with double hashing
full work available at URL: https://doi.org/10.1007/bf01192048
OpenAlex ID: W1974088338
description: scientific article; zbMATH DE number 809152