Typical Depth of a Digital Search Tree built on a general source
From MaRDI portal
Publication:5194751
DOI10.1137/1.9781611973204.1zbMath1430.68044OpenAlexW2295484528MaRDI QIDQ5194751
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (3)
The Depoissonisation quintet: Rice-Poisson-Mellin-Newton-Laplace ⋮ Gaussian Distribution of Trie Depth for Strongly Tame Sources ⋮ Process convergence for the complexity of radix selection on Markov sources
This page was built for publication: Typical Depth of a Digital Search Tree built on a general source
