Open-addressing hashing with unequal-probability keys

DOI10.1016/0022-0000(80)90028-8zbMath0453.68027OpenAlexW2080293730MaRDI QIDQ1149252

Gaston H. Gonnet

Publication date: 1980

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(80)90028-8

zbMATH Keywords

analysis of algorithmsasymptotic analysisZipf lawdirect chainingfrequency loadingLotka's lawtable searchinguniform probing

Mathematics Subject Classification ID

Searching and sorting (68P10) Special processes (60K99) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Specification and verification (program logics, model checking, etc.) (68Q60) Euler-Maclaurin formula in numerical analysis (65B15)

Related Items (1)

Parking with density

Cites Work

• Unnamed Item
• Unnamed Item
• The analysis of double hashing
• Notes on the derivation of asymptotic expressions from summations
• The Analysis of Hashing Techniques That Exhibit k -ary Clustering
• Efficient Ordering of Hash Tables

This page was built for publication: Open-addressing hashing with unequal-probability keys