A note on the analysis of extendible hashing

DOI10.1016/0020-0190(80)90008-3zbMath0447.68077OpenAlexW2091108070MaRDI QIDQ1146528

Andrew Chi-Chih Yao

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90008-3

zbMATH Keywords

asymptotic behaviorextendible hashing

Mathematics Subject Classification ID

Data structures (68P05) Discrete mathematics in relation to computer science (68R99)

Related Items (9)

Order preserving extendible hashing and bucket tries ⋮ On the average height of trees in digital search and dynamic hashing ⋮ On the height of digital trees and related problems ⋮ Extendible hashing with overflow ⋮ On the Stack-Size of General Tries ⋮ A probabilistic analysis of the height of tries and of the complexity of triesort ⋮ The properties of random trees ⋮ Analysis of grid file algorithms ⋮ An approximate analysis of the performance of extendible hashing with elastic buckets

This page was built for publication: A note on the analysis of extendible hashing