On the Stack-Size of General Tries
From MaRDI portal
Publication:2771494
DOI10.1051/ita:2001114zbMath1016.68064OpenAlexW2079108315MaRDI QIDQ2771494
No author found.
Publication date: 27 May 2002
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_2_163_0
Analysis of algorithms (68W40) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Information theory (general) (94A15) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the recursion depth of special tree traversal algorithms
- Mellin transforms and asymptotics: Harmonic sums
- On the height of digital trees and related problems
- On the performance evaluation of extendible hashing and trie searching
- Analytical depoissonization and its applications
- The average height of r-tuply rooted planted plane trees
- A note on the analysis of extendible hashing
- On the average height of trees in digital search and dynamic hashing
- Dynamical sources in information theory: Fundamental intervals and word prefixes
- Dynamical sources in information theory: A general analysis of trie structures
- On the Horton-Strahler number for random tries
- La théorie de Fredholm
- Some results on V-ary asymmetric tries
- Partial-Match Retrieval Algorithms
- An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction
- On the Horton-Strahler Number for Combinatorial Tries
- Produits tensoriels topologiques et espaces nucléaires
- The stack-size of tries: A combinatorial study
This page was built for publication: On the Stack-Size of General Tries