Journals in DBLP

Random Struct. Algorithms
2004, volume: 25, number: 1

1. Vojtech Rödl, Jozef Skokan
   Regularity Lemma for k-uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:25, n:1, pp:1-42 [Journal]
   
2. Michael A. Bender, Saurabh Sethia, Steven Skiena
   Data structures for maintaining set partitions. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:25, n:1, pp:43-67 [Journal]
   
3. Mohammad R. Salavatipour
   A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:25, n:1, pp:68-90 [Journal]
   
4. David A. Levin, Yuval Peres
   Identifying several biased coins encountered by a hidden random walk. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:25, n:1, pp:91-114 [Journal]
   
5. Andrew D. Barbour, Gesine Reinert
   Correction: Small worlds. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:25, n:1, pp:115- [Journal]