Smoothed heights of tries and patricia tries

DOI10.1016/J.TCS.2015.02.009MaRDI QIDQ896160zbMATH OpenOpenAlexFDO

Authors Weitian Tong, Randy Goebel, Guohui Lin

Publication date 11 December 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.02.009

zbMATH Keywords

data structuretriesmoothed analysispatricia trie

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• On the smoothed heights of trie and patricia index trees
• scientific article; zbMATH DE number 1512698
• Towards a complete characterization of tries
• An Analysis of the Height of Tries with Random Weights on the Edges
• Profiles of Tries

Cites work

• scientific article; zbMATH DE number 3757718 (Why is no real title available?)
• scientific article; zbMATH DE number 140470 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• A probabilistic analysis of the height of tries and of the complexity of triesort
• An experimental study of compression methods for dynamic tries
• Analysis of Extendible Hashing
• Asymptotical growth of a class of random trees
• On the Application of the Borel-Cantelli Lemma
• On the average height of trees in digital search and dynamic hashing
• On the performance evaluation of extendible hashing and trie searching
• Paths in a random digital tree: limiting distributions
• Smoothed analysis of algorithms
• Some results on V-ary asymmetric tries

Cited in

(2)

• Influence analysis: A survey of the state-of-the-art
• On the smoothed heights of trie and patricia index trees

Describes a project that uses

Uses Software

• PATRICIA

This page was built for publication: Smoothed heights of tries and patricia tries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896160)