Digital Search Trees Revisited
From MaRDI portal
Publication:3751029
Recommendations
Cited in
(55)- scientific article; zbMATH DE number 88944 (Why is no real title available?)
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Digital access to comparison-based tree data structures and algorithms
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- On the shape of the fringe of various types of random trees
- Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
- Possibilistic search trees
- An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms
- The number of winners in a discrete geometrically distributed sample
- On time-space efficiency of digital trees with adaptive multidigit branching
- On the average depth of asymmetric LC-tries
- Approximate counting : an alternative approach
- On the variance of a class of inductive valuations of data structures for digital search
- On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
- scientific article; zbMATH DE number 3961005 (Why is no real title available?)
- Phase transition in a generalized Eden growth model on a tree
- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
- Notes on protected nodes in digital search trees
- Combinatorics of geometrically distributed random variables: Left-to-right maxima
- Analytic analysis of algorithms
- Further results on digital search trees
- scientific article; zbMATH DE number 7051180 (Why is no real title available?)
- Analysis of random LC tries
- The Ubiquitous Digital Tree
- A characterization of digital search trees from the successful search viewpoint
- On the balance property of Patricia tries: External path length viewpoint
- Some results on tries with adaptive branching.
- Exact and asymptotic distributions in digital and binary search trees
- Philippe Flajolet's early work in combinatorics
- A note on binomial recurrences arising in the analysis of algorithms
- Improved behaviour of tries by adaptive branching
- Dependence between path-length and size in random digital trees
- scientific article; zbMATH DE number 1188119 (Why is no real title available?)
- External Internal Nodes in Digital Search Trees via Mellin Transforms
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees
- Distances in random digital search trees
- The evaluation of an alternative sum with applications to the analysis of some data structures
- Digital search trees with keys of variable length
- On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
- Searching Trees: An Essay
- Probabilistic analysis of adaptative sampling
- A result in order statistics related to probabilistic counting
- Analysis of digital search trees incorporated with paging
- Universal Limit Laws for Depths in Random Trees
- On a tree collision resolution algorithm in presence of capture
- Approximate counting with \(m\) counters: a probabilistic analysis
- Gaussian distribution of trie depth for strongly tame sources
- On some applications of formulae of Ramanujan in the analysis of algorithms
- scientific article; zbMATH DE number 140469 (Why is no real title available?)
- On the cost of searching signature trees
- scientific article; zbMATH DE number 166924 (Why is no real title available?)
- On The variance of the extremal path length in a symmetric digital trie
- A note on the probabilistic analysis of patricia trees
- How to select a loser
- The Wiener index of random digital trees
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)
