Journals in DBLP

Random Struct. Algorithms
1998, volume: 12, number: 1

1. Béla Bollobás, Oliver Riordan
   Colorings generated by monotone properties. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1998, v:12, n:1, pp:1-25 [Journal]
   
2. Olle Häggström
   Uniform and minimal essential spanning forests on trees. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1998, v:12, n:1, pp:27-50 [Journal]
   
3. George S. Lueker
   Exponentially small bounds on the expected optimum of the partition and subset sum problems. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1998, v:12, n:1, pp:51-62 [Journal]
   
4. Mathew D. Penrose
   Random minimal spanning tree and percolation on the N-cube. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1998, v:12, n:1, pp:63-82 [Journal]
   
5. Shao C. Fang, Santosh S. Venkatesh
   The capacity of majority rule. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1998, v:12, n:1, pp:83-109 [Journal]