1. Probabilistic methods in graph theory

   • V. Chvátal

   OriginalPaper Pages: 171 - 182

2. Colouring random graphs

   • Colin McDiarmid

   OriginalPaper Pages: 183 - 200

3. When are NP-hard location problems easy?

   • Dorit S. Hochbaum

   OriginalPaper Pages: 201 - 214

4. Probabilistic analysis of geometric location problems

   • Eitan Zemel

   OriginalPaper Pages: 215 - 238

5. A probabilistic analysis of some greedy cardinality matching algorithms

   • G. Tinhofer

   OriginalPaper Pages: 239 - 254

6. A probabilistic analysis of the set covering problem

   • Carlo Vercellis

   OriginalPaper Pages: 255 - 271

7. Probabilistic analysis of the pure literal heuristic for the satisfiability problem

   • John Franco

   OriginalPaper Pages: 273 - 289

8. The density function of the number of moves to complete the Towers of Hanoi puzzle

   • F. Scarioni
   • M. G. Speranza

   OriginalPaper Pages: 291 - 303

9. Optimal policies in stochastic shop scheduling

   • Michael Pinedo

   OriginalPaper Pages: 305 - 329

10. Randomized algorithms: An annotated bibliography

    • E. Maffioli
    • M. G. Speranza
    • C. Vercellis

    OriginalPaper Pages: 331 - 345