The Ubiquitous Digital Tree
From MaRDI portal
Publication:5449784
DOI10.1007/11672142_1zbMATH Open1136.68364OpenAlexW1517147669MaRDI QIDQ5449784FDOQ5449784
Authors: Philippe Flajolet 
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
Recommendations
- Digital Search Trees Revisited
- scientific article; zbMATH DE number 849078
- The expected profile of digital search trees
- Further results on digital search trees
- On the variety of shapes in digital trees
- scientific article; zbMATH DE number 3961005
- The universal homogeneous binary tree
- Digital access to comparison-based tree data structures and algorithms
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Searching and sorting (68P10)
Cited In (17)
- Some results on tries with adaptive branching.
- Digital access to comparison-based tree data structures and algorithms
- Weighted height of random trees
- Digital Search Trees Revisited
- A new binomial recurrence arising in a graphical compression algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Digital trees and memoryless sources: from arithmetics to analysis
- Dependence between path-length and size in random digital trees
- Dynamical sources in information theory: A general analysis of trie structures
- Towards a realistic analysis of some popular sorting algorithms
- Trie structure for graph sequences
- Dynamic interpolation search revisited
- Profiles of PATRICIA tries
- Gaussian distribution of trie depth for strongly tame sources
- Title not available (Why is that?)
This page was built for publication: The Ubiquitous Digital Tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449784)
