Paths in a random digital tree: limiting distributions
From MaRDI portal
Recommendations
Cited in
(40)- Imbalance in random digital trees
- Asymptotical growth of a class of random trees
- On growing random binary trees
- A diffusion limit for a class of randomly-growing binary trees
- A characterization of digital search trees from the successful search viewpoint
- Normality of tree-growing search strategies
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
- On the distribution for the duration of a randomized leader election algorithm
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees
- How many random questions are necessary to identify n distinct objects?
- Expected worst-case partial match in random quadtries
- Some results on tries with adaptive branching.
- Asymptotic enumeration of sparse graphs with a minimum degree constraint
- Asymptotics and statistics on Fishburn matrices and their generalizations
- Renewals for exponentially increasing lifetimes, with an application to digital search trees
- Continuous-time digital search tree and a border aggregation model
- Limit distribution of distances in biased random tries
- The path length of the Bernoulli splitting algorithm
- Multiple choice tries and distributed hash tables
- scientific article; zbMATH DE number 3965074 (Why is no real title available?)
- Exact and asymptotic distributions in digital and binary search trees
- A Random Graph With a Subcritical Number of Edges
- A note on the probabilistic analysis of patricia trees
- Universal Limit Laws for Depths in Random Trees
- Trie size in a dynamic list structure
- A binomial splitting process in connection with corner parking problems
- Pruned discrete random samples
- The satisfiability threshold for k-XORSAT
- Profile of Tries
- The expected profile of digital search trees
- The oscillatory distribution of distances in random tries
- On tries, contention trees and their analysis
- Improved behaviour of tries by adaptive branching
- Patricia's bad distributions
- Renewal theory in the analysis of tries and strings
- Phase transition in a generalized Eden growth model on a tree
- Rounding of continuous random variables and oscillatory asymptotics
- Smoothed heights of tries and patricia tries
- On the height of digital trees and related problems
- On the silhouette of binary search trees
This page was built for publication: Paths in a random digital tree: limiting distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3715948)
