A multivariate view of random bucket digital search trees

DOI10.1016/S0196-6774(02)00210-9zbMath1010.68047OpenAlexW2028710113MaRDI QIDQ4799525

Hosam M. Mahmoud, Hsien-Kuei Hwang, Prodinger, Helmut, Friedrich Hubalek, William Lew

Publication date: 23 March 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00210-9

zbMATH Keywords

Mellin transformasymptotic normalityprobabilistic analysis of algorithmssearchingsingularity analysisrandom treesEuler transformbucketing

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries ⋮ Asymptotic normality for the size of graph tries built from M-ary tree labelings ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ The Wiener Index of Random Digital Trees

Uses Software

• QUADPACK
• Cubpack++

This page was built for publication: A multivariate view of random bucket digital search trees