Title of article
Probabilistic analysis of the asymmetric digital search trees
Author/Authors
Kazemi, R. Department of Statistics - Imam Khomeini International University, Qazvin , Vahidi-Asl, M. Q Department of Statistics - Shahid Beheshti University, Tehran
Pages
13
From page
161
To page
173
Abstract
In this paper, by applying three functional operators the previous results on the (Poisson) variance
of the external prole in digital search trees will be improved. We study the prole built over n
binary strings generated by a memoryless source with unequal probabilities of symbols and use a
combinatorial approach for studying the Poissonized variance, since the probability distribution of
the prole is unknown.
Keywords
Poisson Variance , Functional Operators , Digital Search Tree
Journal title
Astroparticle Physics
Serial Year
2015
Record number
2441006
Link To Document