Random Structures & Algorithms

Copyright © 2012 Wiley Periodicals, Inc., A Wiley Company

Cover image for Random Structures & Algorithms

Special Issue: Analysis of Algorithms Dedicated to Don Knuth

October - December 2001

Volume 19, Issue 3-4

Pages 149–557

Issue edited by: Helmut Prodinger, Wojciech Szpankowski

    1. Preface (page 149)

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10026

    2. D⋅E⋅K=(1000)8 (pages 150–162)

      Philippe Flajolet

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10022

    3. Convergence properties of functional estimates for discrete distributions (pages 163–193)

      András Antos and Ioannis Kontoyiannis

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10019

    4. Random maps, coalescing saddles, singularity analysis, and Airy phenomena (pages 194–246)

      Cyril Banderier, Philippe Flajolet, Gilles Schaeffer and Michèle Soria

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10021

    5. Phase transition and finite-size scaling for the integer partitioning problem (pages 247–288)

      Christian Borgs, Jennifer Chayes and Boris Pittel

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10004

    6. Size and path length of Patricia tries: Dynamical sources context (pages 289–315)

      Jérémie Bourdon

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10015

    7. Phase changes in random m-ary search trees and generalized quicksort (pages 316–358)

      Hua-Huai Chern and Hsien-Kuei Hwang

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10005

    8. Analysis of random LC tries (pages 359–375)

      Luc Devroye

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10006

    9. Approximating the limiting Quicksort distribution (pages 376–406)

      James Allen Fill and Svante Janson

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10007

    10. Distinctness of compositions of an integer: A probabilistic analysis (pages 407–437)

      Paweł Hitczenko and Guy Louchard

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10008

    11. Asymptotic distribution for the cost of linear probing hashing (pages 438–471)

      Svante Janson

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10009

    12. A generic approach for the unranking of labeled combinatorial classes (pages 472–497)

      Conrado Martínez and Xavier Molinero

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10025

    13. On a multivariate contraction method for random recursive structures with applications to Quicksort (pages 498–524)

      Ralph Neininger

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10010

    14. Analysis of Rabin's irreducibility test for polynomials over finite fields (pages 525–551)

      Daniel Panario, Boris Pittel, Bruce Richmond and Alfredo Viola

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10011

    15. Some applications of the q-Rice formula (pages 552–557)

      Helmut Prodinger

      Article first published online: 27 NOV 2001 | DOI: 10.1002/rsa.10012

SEARCH

SEARCH BY CITATION