Further results on digital search trees

DOI10.1016/0304-3975(88)90023-0zbMath0656.68067OpenAlexW1985558449MaRDI QIDQ1110340

Peter Kirschenhofer, Prodinger, Helmut

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90023-0

zbMATH Keywords

digital search treesinternal path lengthasymptotic analysis of generating functions

Mathematics Subject Classification ID

Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) Data structures (68P05) Algorithms in computer science (68W99)

Related Items (5)

Distances in random digital search trees ⋮ Fringe analysis of plane trees related to cutting and pruning ⋮ Digital search trees with keys of variable length ⋮ A note on binomial recurrences arising in the analysis of algorithms ⋮ Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter

Cites Work

• Unnamed Item
• Unnamed Item
• Digital Search Trees Revisited
• Some results on V-ary asymmetric tries

This page was built for publication: Further results on digital search trees