On the average height of trees in digital search and dynamic hashing

DOI10.1016/0020-0190(81)90033-8zbMath0472.68058OpenAlexW2045083286MaRDI QIDQ1157926

Mireille Régnier

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90033-8

zbMATH Keywords

analysis of algorithmsdata managementdigital search tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Related Items

An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms ⋮ Smoothed heights of tries and patricia tries ⋮ An Analysis of the Height of Tries with Random Weights on the Edges ⋮ On the height of digital trees and related problems ⋮ Extendible hashing with overflow ⋮ On the Stack-Size of General Tries ⋮ Analysis of random LC tries ⋮ A probabilistic analysis of the height of tries and of the complexity of triesort ⋮ Expected worst-case partial match in random quadtries ⋮ Analysis of grid file algorithms ⋮ Laws of large numbers and tail inequalities for random tries and PATRICIA trees

Cites Work

• A note on the analysis of extendible hashing
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• Dynamic hashing
• Unnamed Item

This page was built for publication: On the average height of trees in digital search and dynamic hashing