Universal asymptotics for random tries and PATRICIA trees

DOI10.1007/s00453-004-1137-7zbMath1065.68074OpenAlexW2139886628MaRDI QIDQ1777272

Luc P. Devroye

Publication date: 13 May 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1137-7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (7)

Node profiles of symmetric digital search trees: Concentration properties ⋮ An Analysis of the Height of Tries with Random Weights on the Edges ⋮ Profiles of PATRICIA tries ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ A probabilistic analysis of some tree algorithms ⋮ Dependence between path-length and size in random digital trees ⋮ Asymmetric Rényi Problem

This page was built for publication: Universal asymptotics for random tries and PATRICIA trees