Random Structures & Algorithms

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)

      Version of Record online: 27 NOV 2001 | DOI: 10.1002/rsa.10026

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

      Philippe Flajolet

      Version of Record online: 27 NOV 2001 | DOI: 10.1002/rsa.10022

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

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

      Version of Record online: 27 NOV 2001 | DOI: 10.1002/rsa.10021

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

      Christian Borgs, Jennifer Chayes and Boris Pittel

      Version of Record online: 27 NOV 2001 | DOI: 10.1002/rsa.10004

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

      Luc Devroye

      Version of Record online: 27 NOV 2001 | DOI: 10.1002/rsa.10006

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

      James Allen Fill and Svante Janson

      Version of Record online: 27 NOV 2001 | DOI: 10.1002/rsa.10007

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

      Daniel Panario, Boris Pittel, Bruce Richmond and Alfredo Viola

      Version of Record online: 27 NOV 2001 | DOI: 10.1002/rsa.10011

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

      Helmut Prodinger

      Version of Record online: 27 NOV 2001 | DOI: 10.1002/rsa.10012

SEARCH

SEARCH BY CITATION