Digital search trees revisited

Digital search trees revisited

0.00 Avg rating0 Votes
Article ID: iaor19961093
Country: Belgium
Volume: 36
Start Page Number: 259
End Page Number: 278
Publication Date: Jan 1994
Journal: Cahiers du Centre d'tudes de Recherche Oprationnelle
Authors:
Keywords: search
Abstract:

Interesting parameters in some variations of Digital Search Trees (DST) are analyzed with probabilistic techniques: the m-ary DST is considered in the unbiased (symmetric) or biased (asymmetric) case. Exact and asymptotic distributions of the successful search and the mean number of non-empty modes is biased b-DST are derived in a uniform way.

Reviews

Required fields are marked *. Your email address will not be published.