On the stack-size of general tries

RAIRO - Theoretical Informatics and Applications

Volumn 35, Issue 2, 2001, Pages 163-185

  Bourdon, Jérémie ^a   Nebel, Markus ^b   Vallée, Brigitte ^a  

^a UNIVERSITÉ DE CAEN   (France)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Average case analysis of data structures; Information theory; Mellin analysis; Trie

Indexed keywords

DATA STRUCTURES; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILITY DISTRIBUTIONS; TREES (MATHEMATICS);

DIGITAL TREES; STORAGE OPTIMAL PREORDER TRAVERSAL;

INFORMATION THEORY;

EID: 17944377018     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2001114     Document Type: Article

References (30)

1. An average-case analysis of the Gaussian algorithm for lattice reduction
2. The average height of planted plane trees
3. On the Horton-Strahler number for random tries
4. On the performance of evaluation of extendible hashing and trie searching
5. Mellin transforms and asymptotics: Harmonic sums
6. Partial match retrieval of multidimensional data
7. Trie memory
8. Produit tensoriels topologiques et espaces nucléaires
9. La Théorie de Fredholm
10. Analytical depoissonization and its applications
11. On the recursion depth of special tree traversal algorithms
12. The average height of r-tuply rooted planted plane trees
13. The stack-size of tries, a combinatorial study
14. On the Horton-Strahler number for combinatorial tries
15. Trie hashing analysis
16. On the average height of trees in digital search and dynamic hashing
17. Partial match retrieval algorithms
18. On the height of digital trees and related problem
19. Some results on V-ary asymmetric tries
20. Dynamical sources in information theory: Fundamental intervals and word prefixes
21. Trees everywhere
22. A note on the analysis of extendible hashing