Journals in DBLP

Random Struct. Algorithms
2004, volume: 24, number: 2

1. Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin
   Adding random edges to dense graphs. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:24, n:2, pp:105-117 [Journal]
   
2. Jean-François Marckert
   The rotation correspondence is asymptotically a dilatation. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:24, n:2, pp:118-132 [Journal]
   
3. Brigitte Chauvin, Nicolas Pouyanne
   m-ary Search trees when m ge 27: A strong asymptotics for the space requirements. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:24, n:2, pp:133-154 [Journal]
   
4. Ketan Dalal
   Counting the onion. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:24, n:2, pp:155-165 [Journal]
   
5. Jeong Han Kim, Van H. Vu
   Divide and conquer martingales and the number of triangles in a random graph. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:24, n:2, pp:166-174 [Journal]
   
6. Eldar Fischer, Ilan Newman, Jiri Sgall
   Functions that have read-twice constant width branching programs are not necessarily testable. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:24, n:2, pp:175-193 [Journal]
   
7. Stefanie Gerke, Thomas Schickinger, Angelika Steger
   K₅-free subgraphs of random graphs. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2004, v:24, n:2, pp:194-232 [Journal]