scientific article; zbMATH DE number 1445303
From MaRDI portal
Publication:4952616
Recommendations
- Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
- The variance of the profile in digital search trees
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
- The expected profile of digital search trees
Cited in
(10)- The variance of the height of digital search trees
- Average case analysis for tree labelling schemes
- Paths in a random digital tree: limiting distributions
- Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
- Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
- Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
- Some estimates for the distribution of the height of digital search trees
- Typical depth of a digital search tree built on a general source
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- 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 Q4952616)
