Journal of the ACM Bibliography

Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- computations on discrete structures, searching and sorting; G.2.1 [Discrete Mathematics]: Combinatorics -- generating functions, recurrences and difference equations; G.2.2 [Discrete Mathematics]: Graph Theory -- trees; H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval -- search process

General Terms: Algorithms, Performance

Additional Key Words and Phrases: Balanced trees, data structures, digital search trees, Patricia tries, probabilistic analysis of algorithms, random shape of trees, successful search, unsuccessful search

Selected papers that cite this one

• Philippe Jacquet and Wojciech Szpankowski. Analytical depoissonization and its applications. Theoretical Computer Science, 201(1-2):1-62, 6 July 1998. Fundamental Study.

• Peter Kirschenhofer, Helmut Prodinger, and Wojciech Szpankowski. Digital search trees again revisited: The internal path length perspective. SIAM Journal on Computing, 23(3):598-616, June 1994.

Shortcuts: