Analysis of Extendible Hashing
From MaRDI portal
Publication:3953217
DOI10.1109/TSE.1982.236022zbMath0491.68096MaRDI QIDQ3953217
Publication date: 1982
Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)
Related Items (12)
On the distribution for the duration of a randomized leader election algorithm ⋮ A note on the probabilistic analysis of patricia trees ⋮ Smoothed heights of tries and patricia tries ⋮ On permutations with limited repetition ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ Analysis of random LC tries ⋮ How many random questions are necessary to identify \(n\) distinct objects? ⋮ Expected worst-case partial match in random quadtries ⋮ Analysis of grid file algorithms ⋮ An approximate analysis of the performance of extendible hashing with elastic buckets ⋮ Lattice path combinatorics and linear probing ⋮ Laws of large numbers and tail inequalities for random tries and PATRICIA trees
This page was built for publication: Analysis of Extendible Hashing
