The Ubiquitous Digital Tree
From MaRDI portal
Publication:5449784
DOI10.1007/11672142_1zbMath1136.68364OpenAlexW1517147669MaRDI QIDQ5449784
Publication date: 19 March 2008
Published in: STACS 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11672142_1
Searching and sorting (68P10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)
Related Items
Gaussian Distribution of Trie Depth for Strongly Tame Sources ⋮ Towards a Realistic Analysis of Some Popular Sorting Algorithms ⋮ Profiles of PATRICIA tries ⋮ Weighted height of random trees ⋮ Dependence between path-length and size in random digital trees ⋮ Dynamic interpolation search revisited
