scientific article; zbMATH DE number 3978406
From MaRDI portal
Publication:3742733
Recommendations
Cited in
(27)- Analytical depoissonization and its applications
- A characterization of digital search trees from the successful search viewpoint
- 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
- On the variety of shapes in digital trees
- Expected worst-case partial match in random quadtries
- Some results on tries with adaptive branching.
- An analytic approach to the asymptotic variance of trie statistics and related structures
- A probabilistic analysis of some tree algorithms
- Limit distribution of distances in biased random tries
- Exact and asymptotic distributions in digital and binary search trees
- A general central limit theorem for shape parameters of m-ary tries and PATRICIA tries
- Universal Limit Laws for Depths in Random Trees
- scientific article; zbMATH DE number 1545683 (Why is no real title available?)
- Dependence between path-length and size in random digital trees
- Trie size in a dynamic list structure
- A binomial splitting process in connection with corner parking problems
- Gaussian distribution of trie depth for strongly tame sources
- Advancing in the presence of a demon
- The expected profile of digital search trees
- The oscillatory distribution of distances in random tries
- On tries, contention trees and their analysis
- Mellin transforms and asymptotics: Harmonic sums
- On the variance of a class of inductive valuations of data structures for digital search
- A note on binomial recurrences arising in the analysis of algorithms
- Renewal theory in the analysis of tries and strings
- On the height of digital trees and related problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742733)
