Journals in DBLP

Random Struct. Algorithms
2001, volume: 19, number: 3-4

1. Philippe Flajolet
   D·E·K=(1000)₈. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2001, v:19, n:3-4, pp:150-162 [Journal]
   
2. Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, Michèle Soria
   Random maps, coalescing saddles, singularity analysis, and Airy phenomena. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2001, v:19, n:3-4, pp:194-246 [Journal]
   
3. Christian Borgs, Jennifer T. Chayes, Boris Pittel
   Phase transition and finite-size scaling for the integer partitioning problem. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2001, v:19, n:3-4, pp:247-288 [Journal]
   
4. Jérémie Bourdon
   Size and path length of Patricia tries: Dynamical sources context. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2001, v:19, n:3-4, pp:289-315 [Journal]
   
5. Hua-Huai Chern, Hsien-Kuei Hwang
   Phase changes in random m-ary search trees and generalized quicksort. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2001, v:19, n:3-4, pp:316-358 [Journal]
   
6. Luc Devroye
   Analysis of random LC tries. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2001, v:19, n:3-4, pp:359-375 [Journal]
   
7. James Allen Fill, Svante Janson
   Approximating the limiting Quicksort distribution. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2001, v:19, n:3-4, pp:376-406 [Journal]
   
8. Pawel Hitczenko, Guy Louchard
   Distinctness of compositions of an integer: A probabilistic analysis. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2001, v:19, n:3-4, pp:407-437 [Journal]
   
9. Svante Janson
   Asymptotic distribution for the cost of linear probing hashing. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2001, v:19, n:3-4, pp:438-471 [Journal]
   
10. Conrado Martínez, Xavier Molinero
    A generic approach for the unranking of labeled combinatorial classes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:3-4, pp:472-497 [Journal]
    
11. Ralph Neininger
    On a multivariate contraction method for random recursive structures with applications to Quicksort. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:3-4, pp:498-524 [Journal]
    
12. Daniel Panario, Boris Pittel, L. Bruce Richmond, Alfredo Viola
    Analysis of Rabin's irreducibility test for polynomials over finite fields. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:3-4, pp:525-551 [Journal]
    
13. Helmut Prodinger
    Some applications of the q-Rice formula. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:3-4, pp:552-557 [Journal]