Efficient Ordering of Hash Tables

DOI10.1137/0208038zbMath0412.68058OpenAlexW2068291854MaRDI QIDQ4199544

Gaston H. Gonnet, J. Ian Munro

Publication date: 1979

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0208038

zbMATH Keywords

assignment problemssearchingopen addressingefficient ordering of hash tables

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (5)

A unified approach to linear probing hashing with buckets ⋮ Minimean optimal key arrangements in hash tables ⋮ Open-addressing hashing with unequal-probability keys ⋮ The Diagonal Poisson Transform and its application to the analysis of a hashing scheme ⋮ Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions

This page was built for publication: Efficient Ordering of Hash Tables