The Stack-Size of Combinatorial Tries Revisited

Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-00958969
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 4:54:26 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:22 AM
Document(s) archivé(s) le : Friday, June 13, 2014 - 12:06:14 PM

File

dm050101.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00958969, version 1

Collections

Citation

Markus E. Nebel. The Stack-Size of Combinatorial Tries Revisited. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.1-16. ⟨hal-00958969⟩

Share

Metrics

Record views

69

Files downloads

254