Journals in DBLP

Random Struct. Algorithms
1991, volume: 2, number: 2

1. Nicholas Pippenger
   The Blocking Probability of Spider-Web Networks. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1991, v:2, n:2, pp:121-150 [Journal]
   
2. Guy Louchard, René Schott
   Probabilistic Analysis of Some Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1991, v:2, n:2, pp:151-186 [Journal]
   
3. Michael Drmota, Peter Kirschenhofer
   On Generalized Independent Subsets of Trees. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1991, v:2, n:2, pp:187-208 [Journal]
   
4. Svante Janson, Jan Kratochvíl
   Proportional Graphs. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1991, v:2, n:2, pp:209-224 [Journal]
   
5. Béla Bollobás, Alan M. Frieze
   Spanning Maximal Planar Subgraphs of Random Graphs. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1991, v:2, n:2, pp:225-232 [Journal]
   
6. Martin E. Dyer, Alan M. Frieze
   Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1991, v:2, n:2, pp:233-240 [Journal]
   
7. Fan R. K. Chung
   Regularity Lemmas for Hypergraphs and Quasi-randomness. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1991, v:2, n:2, pp:241-252 [Journal]