An algorithmic approach to discovering and provingq-series identities G. E. AndrewsA. Knopfmacher OriginalPaper Pages: 34 - 43
Transitional behaviors of the average cost of quicksort with median-of-(2t + 1) H. -H. ChernH. -K. Hwang OriginalPaper Pages: 44 - 69
A unified presentation of some urn models M. DrmotaD. GardyB. Gittenberger OriginalPaper Pages: 120 - 147
Partial match queries in relaxed multidimensional search trees C. MartínezA. PanholzerH. Prodinger OriginalPaper Pages: 181 - 204
Smallest components in decomposable structures: Exp-log class D. PanarioB. Richmond OriginalPaper Pages: 205 - 226
Analysis of an adaptive algorithm to find the two nearest neighbors P. V. Poblete OriginalPaper Pages: 227 - 237
Dynamical sources in information theory: Fundamental intervals and word prefixes B. Vallée OriginalPaper Pages: 262 - 306
Dynamical sources in information theory: A general analysis of trie structures J. ClémentP. FlajoletB. Vallée OriginalPaper Pages: 307 - 369