1. Preface

   • R. Kemp
   • H. Prodinger

   OriginalPaper Pages: 237 - 239

2. Lopsided Trees, I: Analyses

   • V. Choi
   • M. J. Golin

   OriginalPaper Pages: 240 - 290

3. On the Probablistic Worst-Case Time of ``Find''

   • L. Devroye

   OriginalPaper Pages: 291 - 303

4. The Asymptotic Number of Leftist Trees

   • M. Drmota

   OriginalPaper Pages: 304 - 317

5. Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source

   • P. Jacquet
   • W. Szpankowski
   • J. Tang

   OriginalPaper Pages: 318 - 360

6. Analytic Variations on the Airy Distribution

   • P. Flajolet
   • G. Louchard

   OriginalPaper Pages: 361 - 377

7. Efficient Reorganization of Binary Search Trees

   • M. Hofri
   • H. Shachnai

   OriginalPaper Pages: 378 - 402

8. A Limit Law for Outputs in Random Recursive Circuits

   • T. Tsukiji
   • H. Mahmoud

   OriginalPaper Pages: 403 - 412

9. Exact Largest and Smallest Size of Components

   • D. Panario
   • B. Richmond

   OriginalPaper Pages: 413 - 432

10. A q -Analogue of the Path Length of Binary Search Trees

    • H. Prodinger

    OriginalPaper Pages: 433 - 441

11. Stochastic Analysis of Shell Sort

    • R. T. Smythe
    • J. Wellner

    OriginalPaper Pages: 442 - 457