Journals in DBLP

Random Struct. Algorithms
2003, volume: 23, number: 4

1. Richard A. Duke, Paul Erdös, Vojtech Rödl
   On large intersecting subfamilies of uniform setfamilies. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2003, v:23, n:4, pp:351-356 [Journal]
   
2. Luc Devroye, Ralph Neininger
   Random suffix search trees. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2003, v:23, n:4, pp:357-396 [Journal]
   
3. Jirí Matousek, Milos Stojakovic
   On restricted min-wise independence of permutations. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2003, v:23, n:4, pp:397-408 [Journal]
   
4. Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin
   Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2003, v:23, n:4, pp:409-433 [Journal]
   
5. Robert P. Dobrow, James Allen Fill
   Speeding up the FMMR perfect sampling algorithm: A case study revisited. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2003, v:23, n:4, pp:434-452 [Journal]