Journals in DBLP
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 ] 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 ] 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 ] Ketan Dalal Counting the onion. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:24, n:2, pp:155-165 [Journal ] 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 ] 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 ] Stefanie Gerke , Thomas Schickinger , Angelika Steger K_{5} -free subgraphs of random graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:24, n:2, pp:194-232 [Journal ]