External Links

    Journal: Algorithmica

    Volume 31, Issue 3

    240 -- 290Vicky Siu-Ngan Choi, Mordecai J. Golin. Lopsided Trees, I: Analyses
    291 -- 303Luc Devroye. On the Probablistic Worst-Case Time of Find
    304 -- 317Michael Drmota. The Asymptotic Number of Leftist Trees
    318 -- 360Philippe Jacquet, Wojciech Szpankowski, Jing Tang. Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source
    361 -- 377Philippe Flajolet, Guy Louchard. Analytic Variations on the Airy Distribution
    378 -- 402Micha Hofri, Hadas Shachnai. Efficient Reorganization of Binary Search Trees
    403 -- 412Tatsuie Tsukiji, Hosam M. Mahmoud. A Limit Law for Outputs in Random Recursive Circuits
    413 -- 432Daniel Panario, L. Bruce Richmond. Exact Largest and Smallest Size of Components
    433 -- 441Helmut Prodinger. A q-Analogue of the Path Length of Binary Search Trees
    442 -- 457Robert T. Smythe, J. Wellner. Stochastic Analysis of Shell Sort
    runs on