Further results on digital search trees
From MaRDI portal
Publication:1110340
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
Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) Data structures (68P05) Algorithms in computer science (68W99)
Related Items
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