Digital Search Trees Revisited
From MaRDI portal
Publication:3751029
DOI10.1137/0215054zbMATH Open0611.68041OpenAlexW1971361861MaRDI QIDQ3751029FDOQ3751029
Authors: 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
Recommendations
Cited In (53)
- An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms
- Notes on protected nodes in digital search trees
- Some results on tries with adaptive branching.
- Approximate counting : an alternative approach
- A note on binomial recurrences arising in the analysis of algorithms
- Improved behaviour of tries by adaptive branching
- Digital access to comparison-based tree data structures and algorithms
- On the balance property of Patricia tries: External path length viewpoint
- Analysis of random LC tries
- Exact and asymptotic distributions in digital and binary search trees
- Further results on digital search trees
- On the variance of a class of inductive valuations of data structures for digital search
- Title not available (Why is that?)
- On the cost of searching signature trees
- The number of winners in a discrete geometrically distributed sample
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- Distances in random digital search trees
- Phase transition in a generalized Eden growth model on a tree
- A note on the probabilistic analysis of patricia trees
- On time-space efficiency of digital trees with adaptive multidigit branching
- Title not available (Why is that?)
- A characterization of digital search trees from the successful search viewpoint
- On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
- A result in order statistics related to probabilistic counting
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Wiener Index of Random Digital Trees
- Approximate counting with \(m\) counters: a probabilistic analysis
- How to select a loser
- Combinatorics of geometrically distributed random variables: Left-to-right maxima
- Philippe Flajolet's early work in combinatorics
- On the shape of the fringe of various types of random trees
- The evaluation of an alternative sum with applications to the analysis of some data structures
- Title not available (Why is that?)
- Dependence between path-length and size in random digital trees
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees
- Probabilistic analysis of adaptative sampling
- Gaussian Distribution of Trie Depth for Strongly Tame Sources
- On a tree collision resolution algorithm in presence of capture
- On some applications of formulae of Ramanujan in the analysis of algorithms
- Searching Trees: An Essay
- On the average depth of asymmetric LC-tries
- Digital search trees with keys of variable length
- The Ubiquitous Digital Tree
- Universal Limit Laws for Depths in Random Trees
- Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
- Possibilistic search trees
- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
- On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
- External Internal Nodes in Digital Search Trees via Mellin Transforms
- Analytic analysis of algorithms
- On The variance of the extremal path length in a symmetric digital trie
This page was built for publication: Digital Search Trees Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751029)
