Profiles of Tries

DOI10.1137/070685531zbMath1191.68898OpenAlexW2040166263MaRDI QIDQ3642866

Wojciech Szpankowski, Pierre Nicodème, Gahyun Park, Hsien-Kuei Hwang

Publication date: 6 November 2009

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a7a533d798d298ad147067aa82968ebad93d923b

zbMATH Keywords

profileMellin transformheightshortest pathdepthsingularity analysistriesdigital treessaddle-point methodanalytic poissonizationfill-up level

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Central limit and other weak theorems (60F05) Trees (05C05) Searching and sorting (68P10)

Related Items (15)

Limit Theorems for Subtree Size Profiles of Increasing Trees ⋮ Normal Limit Law for Protected Node Profile of Random Recursive Trees ⋮ Node profiles of symmetric digital search trees: Concentration properties ⋮ A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries ⋮ Asymptotic expectation of protected node profile in random digital search trees ⋮ Profiles of PATRICIA tries ⋮ Shape Measures of Random Increasing k-trees ⋮ The degree profile of random Pólya trees ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ On tries, contention trees and their analysis ⋮ The expected profile of digital search trees ⋮ A functional limit theorem for the profile of \(b\)-ary trees ⋮ Asymmetric Rényi Problem ⋮ The Wiener Index of Random Digital Trees ⋮ Limit theorems for patterns in phylogenetic trees

This page was built for publication: Profiles of Tries