Open-addressing hashing with unequal-probability keys
From MaRDI portal
Publication:1149252
DOI10.1016/0022-0000(80)90028-8zbMath0453.68027MaRDI QIDQ1149252
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
analysis of algorithms; asymptotic analysis; Zipf law; direct chaining; frequency loading; Lotka's law; table searching; uniform probing
68P10: Searching and sorting
60K99: Special processes
41A60: Asymptotic approximations, asymptotic expansions (steepest descent, etc.)
68Q60: Specification and verification (program logics, model checking, etc.)
65B15: Euler-Maclaurin formula in numerical analysis
Related Items
Cites Work