Journals in DBLP
Alon Amit , Nathan Linial , Jirí Matousek Random lifts of graphs: Independence and chromatic number. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:20, n:1, pp:1-22 [Journal ] Ricardo A. Baeza-Yates , Gonzalo Navarro New and faster filters for multiple approximate string matching. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:20, n:1, pp:23-49 [Journal ] Bae-Shi Huang , Ljubomir Perkovic , Eric Schmutz Inexpensive d-dimensional matchings. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:20, n:1, pp:50-58 [Journal ] Jason Schweinsberg An O(n^{2} ) bound for the relaxation time of a Markov chain on cladograms. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:20, n:1, pp:59-70 [Journal ] Alexander Gnedin , Sergei Kerov Fibonacci solitaire. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:20, n:1, pp:71-88 [Journal ] Paul Balister Vertex-distinguishing edge colorings of random graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:20, n:1, pp:89-97 [Journal ] Martin E. Dyer , Catherine S. Greenhill , Michael Molloy Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:20, n:1, pp:98-114 [Journal ] Jean-François Marckert , Alois Panholzer Noncrossing trees are almost conditioned Galton-Watson trees. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:20, n:1, pp:115-125 [Journal ] Tom Bohman , Alan M. Frieze Addendum to avoiding a giant component. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:20, n:1, pp:126-130 [Journal ]