2009/12/2 符麥克教授專題演講
演講者：
單 位：國立交通大學應用數學系
日 期：2009年12月2日 PM 14:30
地 點：國立高雄大學理學院408室
講 題：
摘 要：
Digital trees are fundamental data structures in computer science. Consequently, their analysis has attracted a lot of attention over the last three decades. In particular, obtaining asymptotic expansions for the variance turned out to be very challenging and previous analyses were long and messy. Recently, we together with H.-K. Hwang and V. Zacharovas (both Academia Sinca) found a new approach which greatly simplifies the derivation as well as gives more simpler expressions for the involved constants. In my talk I will introduce previous approaches and our new approach for digital search trees. If time permits, I will also discuss extensions to bucket digital search trees as well as related models such as tries, patricia tries, etc. for which our new approach yields simpler results as well.