An algorithm for finding hamilton paths and cycles in random graphs B. BollobásT. I. FennerA. M. Frieze OriginalPaper Pages: 327 - 341
Expanders obtained from affine transformations Shuji JimboAkira Maruoka OriginalPaper Pages: 343 - 355
Randomized rounding: A technique for provably good algorithms and algorithmic proofs Prabhakar RaghavanClark D. Tompson OriginalPaper Pages: 365 - 374
Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources Umesh V. Vazirani OriginalPaper Pages: 375 - 392