Typical depth of a digital search tree built on a general source
From MaRDI portal
Publication:5194751
Recommendations
Cited in
(10)- Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
- Average case analysis of leaf-centric binary tree sources
- Digital Search Trees Revisited
- Digital search trees and chaos game representation
- The expected profile of digital search trees
- Digital trees and memoryless sources: from arithmetics to analysis
- The depoissonisation quintet: Rice-Poisson-Mellin-Newton-Laplace
- scientific article; zbMATH DE number 777288 (Why is no real title available?)
- Process convergence for the complexity of radix selection on Markov sources
- Gaussian distribution of trie depth for strongly tame sources
This page was built for publication: Typical depth of a digital search tree built on a general source
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5194751)