Smoothed heights of tries and patricia tries

DOI10.1016/J.TCS.2015.02.009zbMATH Open1332.68037OpenAlexW2023422760MaRDI QIDQ896160FDOQ896160

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

Recommendations

• On the smoothed heights of trie and patricia index trees
• Publication:4508387
• Towards a complete characterization of tries
• An Analysis of the Height of Tries with Random Weights on the Edges
• Profiles of Tries

zbMATH Keywords

data structuretriesmoothed analysispatricia trie

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Application of the Borel-Cantelli Lemma
• Smoothed analysis of algorithms
• Asymptotical growth of a class of random trees
• Paths in a random digital tree: limiting distributions
• Some results on V-ary asymmetric tries
• On the performance evaluation of extendible hashing and trie searching
• On the average height of trees in digital search and dynamic hashing
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Cited In (2)

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

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)