On the stack-size of general tries

DOI10.1051/ITA:2001114MaRDI QIDQ2771494zbMATH OpenOpenAlexFDO

Authors Jérémie Bourdon, Markus Nebel, Brigitte Vallée

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, https://eudml.org/doc/222100, https://semanticscholar.org/paper/d53979d96ecadcf3cbd8ef3094b5a9e0cae2fed0

zbMATH Keywords

digital treesstack-size

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Information theory (general) (94A15)

Recommendations

• The stack-size of tries: A combinatorial study
• The stack-size of combinatorial tries revisited
• Generalizing generalized tries
• New results on the size of tries
• On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.)
• A note on the asymptotic behavior of the depth of tries
• Concentration of Size and Path Length of Tries
• scientific article; zbMATH DE number 3853099
• A probabilistic analysis of the height of tries and of the complexity of triesort
• The height of list-tries and TST

Cites work

• A note on the analysis of extendible hashing
• An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction
• Analytical depoissonization and its applications
• Dynamical sources in information theory: A general analysis of trie structures
• Dynamical sources in information theory: Fundamental intervals and word prefixes
• scientific article; zbMATH DE number 53861 (Why is no real title available?)
• scientific article; zbMATH DE number 125879 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 194543 (Why is no real title available?)
• scientific article; zbMATH DE number 194559 (Why is no real title available?)
• scientific article; zbMATH DE number 3390782 (Why is no real title available?)
• scientific article; zbMATH DE number 3195672 (Why is no real title available?)
• La théorie de Fredholm
• Mellin transforms and asymptotics: Harmonic sums
• On the average height of trees in digital search and dynamic hashing
• On the height of digital trees and related problems
• On the Horton-Strahler Number for Combinatorial Tries
• On the Horton-Strahler number for random tries
• On the performance evaluation of extendible hashing and trie searching
• On the recursion depth of special tree traversal algorithms
• Partial-Match Retrieval Algorithms
• Produits tensoriels topologiques et espaces nucléaires
• Some results on V-ary asymmetric tries
• The average height of r-tuply rooted planted plane trees
• The stack-size of combinatorial tries revisited
• The stack-size of tries: A combinatorial study

Cited in

(5)

• Dynamical sources in information theory: A general analysis of trie structures
• An analytic approach to the asymptotic variance of trie statistics and related structures
• The stack-size of combinatorial tries revisited
• scientific article; zbMATH DE number 140470 (Why is no real title available?)
• The stack-size of tries: A combinatorial study

This page was built for publication: On the stack-size of general tries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2771494)