The size of random bucket trees via urn models

DOI10.1007/s00236-002-0096-1zbMath1034.68121OpenAlexW4247377412MaRDI QIDQ1403333

Hosam M. Mahmoud

Publication date: 1 September 2003

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-002-0096-1

zbMATH Keywords

nonclassic Pólya urn models

Mathematics Subject Classification ID

Data structures (68P05) Randomized algorithms (68W20)

Related Items (10)

Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates ⋮ A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits ⋮ Asymptotics in random recursive circuits ⋮ Random sprouts as internet models, and Pólya processes ⋮ Distributions in the Ehrenfest process ⋮ Exact and limiting distributions in diagonal Pólya processes ⋮ Central limit theorems for generalized Pólya urn models ⋮ Functional limit theorems for multitype branching processes and generalized Pólya urns. ⋮ Unnamed Item

This page was built for publication: The size of random bucket trees via urn models