In the present paper we consider a generalized class of extended binary trees in which leaves are distinguished in order to represent the location of a key within a trie of the same structure. We prove an exact asymptotic equivalent to the average stack-size of trees with α internal nodes and β leaves corresponding to keys; we assume that all trees with the same parameters α and β have the same probability. The assumption of that uniform model is motivated for example by the usage of tries for the compression of blockcodes. Furthermore, we will prove asymptotics for the r-th moments of the stack-size and we will show that a normalized stack-size possesses a theta distribution in the limit.

Source : oai:HAL:hal-00958969v1

Volume: Vol. 5

Published on: January 1, 2002

Submitted on: March 26, 2015

Keywords: Analytical Combinatorics,Tries,Blockcodes,Stack-Size,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 98 times.

This article's PDF has been downloaded 86 times.