Journals in DBLP

Random Struct. Algorithms
2002, volume: 20, number: 3

1. Tibor Jordán, Alessandro Panconesi
   Preface. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2002, v:20, n:3, pp:261- [Journal]
   
2. Van H. Vu
   Concentration of non-Lipschitz functions and applications. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2002, v:20, n:3, pp:262-316 [Journal]
   
3. Svante Janson, Andrzej Rucinski
   The infamous upper tail. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2002, v:20, n:3, pp:317-342 [Journal]
   
4. Robert D. Carr, Santosh Vempala
   Randomized metarounding. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2002, v:20, n:3, pp:343-352 [Journal]
   
5. Bernd Gärtner
   The Random-Facet simplex algorithm on combinatorial cubes. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2002, v:20, n:3, pp:353-381 [Journal]
   
6. Eran Halperin, Uri Zwick
   A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2002, v:20, n:3, pp:382-402 [Journal]
   
7. Uriel Feige, Gideon Schechtman
   On the optimality of the random hyperplane rounding technique for MAX CUT. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2002, v:20, n:3, pp:403-440 [Journal]
   
8. Claire Kenyon, Michael Mitzenmacher
   Linear waste of best fit bin packing on skewed distributions. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2002, v:20, n:3, pp:441-464 [Journal]
   
9. Goran Konjevod, R. Ravi, Aravind Srinivasan
   Approximation algorithms for the covering Steiner problem. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2002, v:20, n:3, pp:465-482 [Journal]