In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile 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 profile is unknown.
Kazemi, R., Vahidi-asl, M. (2015). Probabilistic analysis of the asymmetric digital search trees. International Journal of Nonlinear Analysis and Applications, 6(2), 161-173. doi: 10.22075/ijnaa.2015.266
MLA
Ramin Kazemi; Mohammad Qasem Vahidi-asl. "Probabilistic analysis of the asymmetric digital search trees". International Journal of Nonlinear Analysis and Applications, 6, 2, 2015, 161-173. doi: 10.22075/ijnaa.2015.266
HARVARD
Kazemi, R., Vahidi-asl, M. (2015). 'Probabilistic analysis of the asymmetric digital search trees', International Journal of Nonlinear Analysis and Applications, 6(2), pp. 161-173. doi: 10.22075/ijnaa.2015.266
VANCOUVER
Kazemi, R., Vahidi-asl, M. Probabilistic analysis of the asymmetric digital search trees. International Journal of Nonlinear Analysis and Applications, 2015; 6(2): 161-173. doi: 10.22075/ijnaa.2015.266
)