Smoothed heights of tries and patricia tries
type: Item
instance of: scholarly article
title: Smoothed heights of tries and patricia tries
zbMATH Open document ID: 1332.68037
author: Weitian Tong
author: Randy Goebel
author: Guohui Lin
published in: Theoretical Computer Science
publication date: 2015-12-11T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6520547
zbMATH Keywords: smoothed analysis
zbMATH Keywords: data structure
zbMATH Keywords: trie
zbMATH Keywords: patricia trie
describes a project that uses: PATRICIA
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.02.009
OpenAlex ID: W2023422760
cites work: On the Application of the Borel-Cantelli Lemma
cites work: Q4769056
cites work: A probabilistic analysis of the height of tries and of the complexity of triesort
cites work: On the performance evaluation of extendible hashing and trie searching
cites work: Q3940858
cites work: Q4057549
cites work: Analysis of Extendible Hashing
cites work: An experimental study of compression methods for dynamic tries
cites work: Asymptotical growth of a class of random trees
cites work: Paths in a random digital tree: limiting distributions
cites work: On the average height of trees in digital search and dynamic hashing
cites work: Smoothed analysis of algorithms
cites work: Some results on V-ary asymmetric tries
cites work: Q4028887
DOI: 10.1016/J.TCS.2015.02.009
description: scientific article; zbMATH DE number 6520547