Volume 19,
Number 1,
August 2001
Volume 19,
Number 2,
September 2001
Volume 19,
Number 3-4,
October-December 2001
Analysis of Algorithms Dedicated to Donald E. Knuth
- Philippe Flajolet:
D·E·K=(1000)8.
150-162
- Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, Michèle Soria:
Random maps, coalescing saddles, singularity analysis, and Airy phenomena.
194-246
- Christian Borgs, Jennifer T. Chayes, Boris Pittel:
Phase transition and finite-size scaling for the integer partitioning problem.
247-288
- Jérémie Bourdon:
Size and path length of Patricia tries: Dynamical sources context.
289-315
- Hua-Huai Chern, Hsien-Kuei Hwang:
Phase changes in random m-ary search trees and generalized quicksort.
316-358
- Luc Devroye:
Analysis of random LC tries.
359-375
- James Allen Fill, Svante Janson:
Approximating the limiting Quicksort distribution.
376-406
- Pawel Hitczenko, Guy Louchard:
Distinctness of compositions of an integer: A probabilistic analysis.
407-437
- Svante Janson:
Asymptotic distribution for the cost of linear probing hashing.
438-471
- Conrado Martínez, Xavier Molinero:
A generic approach for the unranking of labeled combinatorial classes.
472-497
- Ralph Neininger:
On a multivariate contraction method for random recursive structures with applications to Quicksort.
498-524
- Daniel Panario, Boris Pittel, L. Bruce Richmond, Alfredo Viola:
Analysis of Rabin's irreducibility test for polynomials over finite fields.
525-551
- Helmut Prodinger:
Some applications of the q-Rice formula.
552-557
Last update Mon Feb 13 04:55:55 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
