A characterization of digital search trees from the successful search viewpoint

DOI10.1016/0304-3975(91)90050-CzbMath0746.68027MaRDI QIDQ1183573

Wojciech Szpankowski

Publication date: 28 June 1992

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

zbMATH Keywords

digital search trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items

Distances in random digital search trees, Mellin transforms and asymptotics: Finite differences and Rice's integrals, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, A note on binomial recurrences arising in the analysis of algorithms, The expected profile of digital search trees, On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the performance evaluation of extendible hashing and trie searching
• The evaluation of an alternative sum with applications to the analysis of some data structures
• On The variance of the extremal path length in a symmetric digital trie
• Poisson multiple-access contention with binary feedback
• Patricia tries again revisited
• Paths in a random digital tree: limiting distributions
• Digital Search Trees Revisited
• Some results on V-ary asymmetric tries
• Partial match retrieval of multidimensional data