Some results on tries with adaptive branching.

DOI10.1016/S0304-3975(01)00415-7zbMath1061.68036OpenAlexW2028802241MaRDI QIDQ1853567

Yuriy A. Reznik

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00415-7

zbMATH Keywords

Asymptotic analysisTrieAdaptive branchingAverage case analysis of algorithmsDigital treeDistributive partitioningLC-trieN-tree

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved behaviour of tries by adaptive branching
• Asymptotical growth of a class of random trees
• A note on the average depth of trees
• Sorting by distributive partitioning
• Analytic variations on bucket selection and sorting
• On the Lambert \(w\) function
• Analysis of N-trees
• Special issue: Average-case analysis of algorithms
• Paths in a random digital tree: limiting distributions
• Digital Search Trees Revisited
• Complexity of strings in the class of Markov sources
• Some results on V-ary asymmetric tries
• The performance of universal encoding
• Searching and sorting real numbers

This page was built for publication: Some results on tries with adaptive branching.