1. Preface

   • H. Prodinger
   • W. Szpankowski

   EditorialNotes Pages: 1 - 2

2. The contraction method for recursive algorithms

   • U. Rösler
   • L. Rüschendorf

   OriginalPaper Pages: 3 - 33

3. An algorithmic approach to discovering and provingq-series identities

   • G. E. Andrews
   • A. Knopfmacher

   OriginalPaper Pages: 34 - 43

4. Transitional behaviors of the average cost of quicksort with median-of-(2t + 1)

   • H. -H. Chern
   • H. -K. Hwang

   OriginalPaper Pages: 44 - 69

5. Bandwidth packing

   • E. G. Coffman
   • A. L. Stolyar

   OriginalPaper Pages: 70 - 88

6. An analytic approach to the height of binary search trees

   • M. Drmota

   OriginalPaper Pages: 89 - 119

7. A unified presentation of some urn models

   • M. Drmota
   • D. Gardy
   • B. Gittenberger

   OriginalPaper Pages: 120 - 147

8. Near-optimal bounded-degree spanning trees

   • J. C. Hansen
   • E. Schmutz

   OriginalPaper Pages: 148 - 180

9. Partial match queries in relaxed multidimensional search trees

   • C. Martínez
   • A. Panholzer
   • H. Prodinger

   OriginalPaper Pages: 181 - 204

10. Smallest components in decomposable structures: Exp-log class

    • D. Panario
    • B. Richmond

    OriginalPaper Pages: 205 - 226

11. Analysis of an adaptive algorithm to find the two nearest neighbors

    • P. V. Poblete

    OriginalPaper Pages: 227 - 237

12. On the analysis of stochastic divide and conquer algorithms

    • U. Rösler

    OriginalPaper Pages: 238 - 261

13. Dynamical sources in information theory: Fundamental intervals and word prefixes

    • B. Vallée

    OriginalPaper Pages: 262 - 306

14. Dynamical sources in information theory: A general analysis of trie structures

    • J. Clément
    • P. Flajolet
    • B. Vallée

    OriginalPaper Pages: 307 - 369