A probabilistic analysis of the height of tries and of the complexity of triesort
From MaRDI portal
Publication:760797
DOI10.1007/BF00264248zbMath0555.68037MaRDI QIDQ760797
Publication date: 1984
Published in: Acta Informatica (Search for Journal in Brave)
Related Items (15)
Brownian motion and algorithm complexity ⋮ A note on the probabilistic analysis of patricia trees ⋮ Rounding of continuous random variables and oscillatory asymptotics ⋮ Asymptotic properties of keys and functional dependencies in random databases ⋮ Smoothed heights of tries and patricia tries ⋮ An Analysis of the Height of Tries with Random Weights on the Edges ⋮ Exact and asymptotic distributions in digital and binary search trees ⋮ On the height of digital trees and related problems ⋮ D?E?K=(1000)8 ⋮ Analysis of random LC tries ⋮ How many random questions are necessary to identify \(n\) distinct objects? ⋮ Dichotomic Selection on Words: A Probabilistic Analysis ⋮ The properties of random trees ⋮ Expected worst-case partial match in random quadtries ⋮ Laws of large numbers and tail inequalities for random tries and PATRICIA trees
Cites Work
This page was built for publication: A probabilistic analysis of the height of tries and of the complexity of triesort