Digital Search Trees Revisited
From MaRDI portal
Publication:3751029
DOI10.1137/0215054zbMath0611.68041OpenAlexW1971361861MaRDI QIDQ3751029
Robert Sedgewick, Philippe Flajolet
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215054
Related Items
Approximate counting with \(m\) counters: a probabilistic analysis, Distances in random digital search trees, A note on the probabilistic analysis of patricia trees, On a tree collision resolution algorithm in presence of capture, Phase transition in a generalized Eden growth model on a tree, Further results on digital search trees, The evaluation of an alternative sum with applications to the analysis of some data structures, On some applications of formulae of Ramanujan in the analysis of algorithms, Combinatorics of geometrically distributed random variables: Left-to-right maxima, On the balance property of Patricia tries: External path length viewpoint, An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms, Philippe Flajolet's early work in combinatorics, Notes on protected nodes in digital search trees, Gaussian Distribution of Trie Depth for Strongly Tame Sources, Exact and asymptotic distributions in digital and binary search trees, Digital search trees with keys of variable length, A characterization of digital search trees from the successful search viewpoint, Mellin transforms and asymptotics: Finite differences and Rice's integrals, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, On the variance of a class of inductive valuations of data structures for digital search, Improved behaviour of tries by adaptive branching, A note on binomial recurrences arising in the analysis of algorithms, How to select a loser, Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter, Analysis of random LC tries, On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol, Dependence between path-length and size in random digital trees, Approximate counting : an alternative approach, Probabilistic analysis of adaptative sampling, Analytic analysis of algorithms, The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects, On The variance of the extremal path length in a symmetric digital trie, On the shape of the fringe of various types of random trees, The number of winners in a discrete geometrically distributed sample, Unnamed Item, On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach, Universal Limit Laws for Depths in Random Trees, On the average depth of asymmetric LC-tries, The Wiener Index of Random Digital Trees, Some results on tries with adaptive branching., A result in order statistics related to probabilistic counting, Laws of large numbers and tail inequalities for random tries and PATRICIA trees
