Trie Hashing with Controlled Load
IEEE Transactions on Software Engineering
Maximum likelihood analysis of algorithms and data structures
Theoretical Computer Science
Renewal theory in the analysis of tries and strings
Theoretical Computer Science
| Hi-index | 754.84 |
A precise asymptotic expansion of the variance of the size of a trie built on random binary strings is presented. This data structure appears in some hashing schemes and communications protocols. The variance is asymptotically linear, and numerical results are given. The reader is referred to an earlier work for formal proofs