Profile of Tries

  title={Profile of Tries},
  author={GaHyun Park and Hsien-Kuei Hwang and Pierre Nicod{\`e}me and Wojciech Szpankowski},
Tries (from retrieval) are one of the most popular data structures on words. They are pertinent to (internal) structure of stored words and several splitting procedures used in diverse contexts. The profile of a trie is a parameter that represents the number of nodes (either internal or external) with the same distance to the root. It is a function of the number of strings stored in a trie and the distance from the root. Several, if not all, trie parameters such as height, size, depth, shortest… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS
16 Citations
85 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 85 references

Paths in a random digital tree: limiting distributions

  • B. Pittel
  • Advances in Applied Probability, 18
  • 1986
Highly Influential
13 Excerpts

Average profiles

  • P. Nicodème
  • from tries to suffix-trees, in 2005 International…
  • 2005
Highly Influential
4 Excerpts

Average Case Analysis of Algorithms on Sequences

  • W. Szpankowski
  • Wiley, New York
  • 2001
Highly Influential
10 Excerpts

Asymptotic growth of a class of random trees

  • B. Pittel
  • Annals of Probability, 18
  • 1985
Highly Influential
8 Excerpts

Local limit theorems for the profiles of random tries

  • H.-K. Hwang
  • preprint
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…