Typical depth of a digital search tree built on a general source

DOI10.1137/1.9781611973204.1MaRDI QIDQ5194751zbMATH OpenOpenAlexFDO

Authors Kanal Hun, Brigitte Vallée

Publication date 17 September 2019

Published in 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973204.1

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• The expected profile of digital search trees
• scientific article; zbMATH DE number 7051180
• On the average profile of symmetric digital search trees
• Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
• scientific article; zbMATH DE number 1445303

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)