On the height of digital trees and related problems
type: Item
instance of: scholarly article
title: On the height of digital trees and related problems
zbMATH Open document ID: 0711.68035
DOI: 10.1007/BF01759045
author: Wojciech Szpankowski
published in: Algorithmica
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 4170080
zbMATH Keywords: Bernoulli model
zbMATH Keywords: suffix tree
zbMATH Keywords: height of trees
zbMATH Keywords: digital trees
zbMATH Keywords: alignment
zbMATH Keywords: order statistics
zbMATH Keywords: Markovian model
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q4057549
cites work: Q3690245
cites work: On the performance evaluation of extendible hashing and trie searching
cites work: Q5595624
cites work: Tree algorithms for packet broadcast channels
cites work: Q3742733
cites work: A probabilistic analysis of the height of tries and of the complexity of triesort
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: A note on the analysis of extendible hashing
cites work: Self-alignments in words and their applications
cites work: Some results on V-ary asymmetric tries
cites work: On The variance of the extremal path length in a symmetric digital trie
cites work: Q4162318
cites work: A class of dependent random variables and their maxima
cites work: Q3794956
cites work: Probability approximations via the Poisson clumping heuristic
cites work: Probabilistic analysis of optimum partitioning
cites work: Counts of long aligned word matches among random letter sequences
cites work: Q4143945
description: scientific article; zbMATH DE number 4170080